Search results for "difficult"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul	Perfect Sorting by Reversals Is Not Always Difficult.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	Evolution scenarios, reversals, common intervals
15	Andres Diaz Legües, Jacques A. Ferland, Celso C. Ribeiro, Jorge R. Vera, Andrés Weintraub	A tabu search approach for solving a difficult forest harvesting machine location problem.	Eur. J. Oper. Res.	2007	DBLP DOI BibTeX RDF
15	Bo Yuan 0003, Marcus Gallagher	Combining Meta-EAs and Racing for Difficult EA Parameter Tuning Tasks.	Parameter Setting in Evolutionary Algorithms	2007	DBLP DOI BibTeX RDF
15	Erik Zenner	Why IV Setup for Stream Ciphers is Difficult.	Symmetric Cryptography	2007	DBLP BibTeX RDF
15	Sami Karjalainen	Why It Is Difficult to Use a Simple Device: An Analysis of a Room Thermostat.	HCI (1)	2007	DBLP DOI BibTeX RDF	thermostat, user interface design, knowledge, information needs
15	Behrang Mohit, Rebecca Hwa	Localization of Difficult-to-Translate Phrases.	WMT@ACL	2007	DBLP BibTeX RDF
15	Dale Kristof, Keith W. Jones, Dale Patrick, Jeffry Ramsey	Complex problems: What makes them complex and difficult to solve?	CTS	2007	DBLP DOI BibTeX RDF
15	Bijan Afsari	What Can Make Joint Diagonalization Difficult?	ICASSP (3)	2007	DBLP DOI BibTeX RDF
15	Pavel Surynek, Lukás Chrpa, Jirí Vyskocil	Solving Difficult Problems by Viewing them as Structured Dense Graphs.	IICAI	2007	DBLP BibTeX RDF
15	Ryszard S. Gessing	Parallel Compensator for Continuous and Relay Control Systems with Difficult Plants.	ACC	2007	DBLP DOI BibTeX RDF
15	Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar	Local Testing of Message Sequence Charts Is Difficult.	FCT	2007	DBLP DOI BibTeX RDF
15	Jano I. van Hemert	Evolving Combinatorial Problem Instances That Are Difficult to Solve.	Evol. Comput.	2006	DBLP DOI BibTeX RDF
15	François-Xavier de Vaujany	Between Eternity and Actualization: The Difficult Co-Evolution of Fields of Communication in the Vatican.	Commun. Assoc. Inf. Syst.	2006	DBLP DOI BibTeX RDF
15	Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger	Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.	Algorithmica	2006	DBLP DOI BibTeX RDF	Computational complexity, Graph coloring, Planar graph, Graph partitioning, Forbidden subgraph
15	Christopher Scaffidi	Why are APIs difficult to learn and use?	ACM Crossroads	2006	DBLP DOI BibTeX RDF
15	Victor Ciesielski, Gayan Wijesinghe, Andrew Innes, Sabu John	Analysis of the Superiority of Parameter Optimization over Genetic Programming for a Difficult Object Detection Problem.	IEEE Congress on Evolutionary Computation	2006	DBLP DOI BibTeX RDF
15	Marilyn E. Noz, Gerald Q. Maguire Jr., Michael P. Zeleznik, Lotta Olivecrona, Henrik Olivecrona, Leon Axel, Mondavi B. Srichai, Linda Moy, Antoinette Murphy-Walcott	Clinical Application of a Semiautomatic 3D Fusion Tool Where Automatic Fusion Techniques Are Difficult to Use.	WBIR	2006	DBLP DOI BibTeX RDF
15	Smriti Sharma, Veena Bansal	Measuring Effectiveness of Computing Facilities in Academic Institutes: A New Solution for a Difficult Problem.	ICSOFT (Selected Papers)	2006	DBLP DOI BibTeX RDF
15	Smriti Sharma, Veena Bansal	Measuring effectiveness of computing facilities in academic institutes a new solution for a difficult problem.	ICSOFT (2)	2006	DBLP BibTeX RDF
15	Richard C. Murphy, Jonathan W. Berry, William McLendon, Bruce Hendrickson, Douglas P. Gregor, Andrew Lumsdaine	DFS: A Simple to Write Yet Difficult to Execute Benchmark.	IISWC	2006	DBLP DOI BibTeX RDF
15	Sandra Kübler, Erhard W. Hinrichs, Wolfgang Maier 0001	Is it Really that Difficult to Parse German?	EMNLP	2006	DBLP BibTeX RDF
15	Yoshiaki Tadokoro, Masanori Natsui, Yasuhiro Seto, Michiru Yamaguchi	Pitch estimation of difficult polyphony sounds overlapping some frequency components.	ICINCO-SPSMC	2006	DBLP BibTeX RDF
15	Joanna Jedrzejowicz, Piotr Jedrzejowicz	Agent-Based Approach to Solving Difficult Scheduling Problems.	IEA/AIE	2006	DBLP DOI BibTeX RDF
15	Dalton S. Rosario	A novel asymmetric variance-based hypothesis test for a difficult surveillance problem.	VISAPP (1)	2006	DBLP BibTeX RDF
15	Serge Sharoff, Bogdan Babych, Anthony Hartley	Using Comparable Corpora to Solve Problems Difficult for Human Translators.	ACL	2006	DBLP BibTeX RDF
15	Suresh K. Bhavnani	Why is it difficult to find comprehensive information? Implications of information scatter for search and design.	J. Assoc. Inf. Sci. Technol.	2005	DBLP DOI BibTeX RDF
15	Zvi Drezner, Peter M. Hahn, Éric D. Taillard	Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	benchmarks, local search, quadratic assignment problem, branch & bound
15	Michael D. Farrell Jr., Russell M. Mersereau	On the impact of PCA dimension reduction for hyperspectral detection of difficult targets.	IEEE Geosci. Remote. Sens. Lett.	2005	DBLP DOI BibTeX RDF
15	Igor Walukiewicz	Difficult Configurations-On the Complexity of LTrL.	Formal Methods Syst. Des.	2005	DBLP DOI BibTeX RDF	verification, temporal logics, trace theory
15	C. Tompsett	Reconfigurability: creating new courses from existing learning objects will always be difficult!	J. Comput. Assist. Learn.	2005	DBLP DOI BibTeX RDF
15	Daniel R. L. Brown	Breaking RSA May Be As Difficult As Factoring.	IACR Cryptol. ePrint Arch.	2005	DBLP BibTeX RDF
15	Javier Minguez	The obstacle-restriction method for robot obstacle avoidance in difficult environments.	IROS	2005	DBLP DOI BibTeX RDF
15	Julien Quint, Ulrich Apel	Does learning how to read Japanese have to be so difficult: and can the web help?	WWW (Special interest tracks and posters)	2005	DBLP DOI BibTeX RDF	graphetic dictionary, reading help, SVG, Japanese, kanji
15	Ann M. Wrightson	Semantics of Well Formed XML as a Human and Machine Readable Language: Why is some XML so difficult to read?	Extreme Markup Languages®	2005	DBLP BibTeX RDF
15	Riccardo Massarelli	The difficult art of pruning in favour of creative thinking.	ITiCSE	2005	DBLP DOI BibTeX RDF	creativity
15	Stefan Droste	Not all linear functions are equally difficult for the compact genetic algorithm.	GECCO	2005	DBLP DOI BibTeX RDF	runtime, theoretical analysis, compact genetic algorithm
15	Russell N. Owen, Gordon Kurtenbach, George W. Fitzmaurice, Thomas Baudel, William Buxton	When it gets more difficult, use both hands: exploring bimanual curve manipulation.	Graphics Interface	2005	DBLP BibTeX RDF	curve editing, task integration, two-handed input, bimanual input, divided attention
15	Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul	Perfect Sorting by Reversals Is Not Always Difficult.	WABI	2005	DBLP DOI BibTeX RDF
15	Eleanor W. Richfield, S. Edward Richfield	The Problem-Space of Difficult Problems.	IC-AI	2005	DBLP BibTeX RDF
15	Olivier Hudry	A note on "Banks winners in tournaments are difficult to recognize" by G. J. Woeginger.	Soc. Choice Welf.	2004	DBLP DOI BibTeX RDF
15	Carmen Ortiz, Mónica Villanueva-Ilufi	Difficult Problems in Threshold Graphs.	Electron. Notes Discret. Math.	2004	DBLP DOI BibTeX RDF
15	Alessandra Riva, Marie-Odile Delorme, Tony Chevalier, Nicolas Guilhot, Corinne Hénaut, Alain Hénaut	The difficult interpretation of transcriptome data: the case of the GATC regulatory network.	Comput. Biol. Chem.	2004	DBLP DOI BibTeX RDF
15	Päivi Häkkinen	What Makes Learning and Understanding in Virtual Teams So Difficult?	Cyberpsychology Behav. Soc. Netw.	2004	DBLP DOI BibTeX RDF
15	Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag	Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization.	Parallel and Distributed Computing and Networks	2004	DBLP BibTeX RDF
15	Jason M. Daida, Michael E. Samples, Bryan T. Hart, Jeffry Halim, Aditya Kumar	Demonstrating constraints to diversity with a tunably difficult problem for genetic programming.	IEEE Congress on Evolutionary Computation	2004	DBLP DOI BibTeX RDF
15	James C. Spall	Cramer-Rao bounds and Monte Carlo calculation of the Fisher information matrix in difficult problems.	ACC	2004	DBLP DOI BibTeX RDF
15	Jorge Díez 0001, Gustavo F. Bayón, José Ramón Quevedo, Juan José del Coz, Oscar Luaces, Jaime Alonso 0001, Antonio Bahamonde	Discovering Relevancies in Very Difficult Regression Problems: Applications to Sensory Data Analysis.	ECAI	2004	DBLP BibTeX RDF
15	Wojciech Bozejko, Mieczyslaw Wodecki	Parallel Tabu Search Method Approach for Very Difficult Permutation Scheduling Problems.	PARELEC	2004	DBLP DOI BibTeX RDF
15	Hsiao-Ching She	Facilitating Students' Learning of Difficult Science Concepts through Integrating a Metacognitive Approach into a Web-based Multimedia Science Learning Program.	CATE	2004	DBLP BibTeX RDF
15	Luming Yang, Hongli Hu, Cuiping Zhu, Zhuqing Yang	The Analysis of the Difficult Points on Developing E-Commerce of the Western Region in China.	ICEB	2004	DBLP BibTeX RDF
15	Henry S. Baird	Difficult and Urgent Open Problems in Document Image Analysis for Libraries.	DIAL	2004	DBLP DOI BibTeX RDF
15	Francis Schmidt, Jim Jagger, Jim McCambell, Craig Slagel	3D animation: difficult or impossible to teach and learn?	SIGGRAPH Panels	2004	DBLP DOI BibTeX RDF
15	Yun Mai, Jinmiao Li, Greg Butler	Difficult Issues in Designing Adaptive Object Model Systems.	ICEIS (3)	2004	DBLP BibTeX RDF
15	Yoshikazu Ishii, Fred D. Otto	A method to extend the domain of convergence for difficult multicomponent, multistage separation problems.	Comput. Chem. Eng.	2003	DBLP DOI BibTeX RDF
15	Gerhard J. Woeginger	Banks winners in tournaments are difficult to recognize.	Soc. Choice Welf.	2003	DBLP DOI BibTeX RDF
15	Greg Goth	Fixing BGP Might Be Difficult--Or Not So Tough.	IEEE Internet Comput.	2003	DBLP DOI BibTeX RDF
15	Jean-François Raskin, Laurent Van Begin	Petri Nets with Non-blocking Arcs are Difficult to Analyze.	INFINITY	2003	DBLP DOI BibTeX RDF
15	Michael Jackson 0001	Why software writing is difficult and will remain so.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
15	Jennifer Lennon, Hermann A. Maurer	Why it is Difficult to Introduce e-Learning into Schools And Some New Solutions.	J. Univers. Comput. Sci.	2003	DBLP DOI BibTeX RDF
15	Daniel E. Callan, Keiichi Tajima, Akiko M. Callan, Rieko Kubo, Shinobu Masaki, Reiko Akahane-Yamada	Learning-induced neural plasticity associated with improved identification performance after training of a difficult second-language phonetic contrast.	NeuroImage	2003	DBLP DOI BibTeX RDF
15	Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger	Recognizing DNA graphs is difficult.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
15	S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi	Easy and difficult objective functions for max cut.	Math. Program.	2003	DBLP DOI BibTeX RDF
15	James A. Whittaker	Why Secure Applications are Difficult to Write.	IEEE Secur. Priv.	2003	DBLP DOI BibTeX RDF
15	Jano I. van Hemert	Evolving binary constraint satisfaction problem instances that are difficult to solve.	IEEE Congress on Evolutionary Computation	2003	DBLP DOI BibTeX RDF
15	Conrad Sanderson, Samy Bengio	Robust Features for Frontal Face Authentication in Difficult Image Conditions.	AVBPA	2003	DBLP DOI BibTeX RDF
15	John L. Lowther, Ching-Kuang Shene	Teaching B-splines is not difficult!	SIGCSE	2003	DBLP DOI BibTeX RDF	de Boor's algorithm, B-splines, curves, knot insertion
15	Robert Uzal, German Montejano, Daniel Riesco, Aristides Dasso, Ana Funes, Narayan C. Debnath	Data Architecture Component Overview of a Balanced Scorecard to Manage the Last and Very Difficult Stage of a Very Important Hydroelectric Project.	IASSE	2003	DBLP BibTeX RDF
15	Xiao Hu, Sindhura Bandhakavi, ChengXiang Zhai	Error analysis of difficult TREC topics.	SIGIR	2003	DBLP DOI BibTeX RDF	hard topics, sub-collection, measures, error analysis, dominance, distraction
15	Bashar Nuseibeh, Jeff Kramer, Anthony Finkelstein	ViewPoints: meaningful relationships are difficult!	ICSE	2003	DBLP DOI BibTeX RDF
15	Feng Lu 0002, Li-C. Wang, Kwang-Ting Cheng, John Moondanos, Ziyad Hanna	A signal correlation guided ATPG solver and its applications for solving difficult industrial cases.	DAC	2003	DBLP DOI BibTeX RDF	boolean equivalence checking, ATPG, boolean satisfiability
15	Kui Chun Su, MaryEllen C. Sievert	How Easy/Difficult to Find Information about Individual Health Insurance from the Internet? An Examination of Ten "Quote" Web Sites.	AMIA	2003	DBLP BibTeX RDF
15	Bo Han, Slobodan Vucetic, Zoran Obradovic	Reranking Medline Citations by Relevance to a Difficult Biological Query.	Neural Networks and Computational Intelligence	2003	DBLP BibTeX RDF
15	Marco Locatelli 0001, Fabio Schoen	Fast Global Optimization of Difficult Lennard-Jones Clusters.	Comput. Optim. Appl.	2002	DBLP DOI BibTeX RDF
15	B. Dräger, Stefan Knecht	When Finding Words Becomes Difficult: Is There Activation of the Subdominant Hemisphere?	NeuroImage	2002	DBLP DOI BibTeX RDF
15	Stefan Droste, Thomas Jansen 0001, Ingo Wegener	Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions.	Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
15	Jorma Laurikkala	Instance-based data reduction for improved identification of difficult small classes.	Intell. Data Anal.	2002	DBLP BibTeX RDF
15	Francisco Barahona, Ranga Anbil	On some difficult linear programs coming from set partitioning.	Discret. Appl. Math.	2002	DBLP DOI BibTeX RDF
15	Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger	The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs.	Math. Program.	2002	DBLP DOI BibTeX RDF
15	Steve Purser	Why access control is difficult.	Comput. Secur.	2002	DBLP DOI BibTeX RDF
15	Stefan Haustein, Jörg Pleumann	Is Participation in the Semantic Web Too Difficult?	ISWC	2002	DBLP DOI BibTeX RDF
15	Ricardo Vilalta, Youssef Drissi	A Characterization of Difficult Problems in Classification.	ICMLA	2002	DBLP BibTeX RDF
15	Brian J. Reiser	Why scaffolding should sometimes make tasks more difficult for learners.	CSCL	2002	DBLP BibTeX RDF
15	Norbert Elkmann, Torsten Felsch, Mario Sack, José F. Saenz, Justus Hortig	Innovative service robot systems for facade cleaning of difficult-to-access areas.	IROS	2002	DBLP DOI BibTeX RDF
15	Zhou Wang 0001, Alan C. Bovik, Ligang Lu	Why is image quality assessment so difficult?	ICASSP	2002	DBLP DOI BibTeX RDF
15	Liddy Nevile	Why is Accessibility Metadata Proving Difficult?	Dublin Core Conference	2002	DBLP BibTeX RDF
15	Jorge López, Narciso Cerpa, Yussef Farran	An eEducation Platform for Teaching-Learning Processes that are Difficult to Visualize.	I3E	2002	DBLP BibTeX RDF
15	John C. Sees Jr., John Shortle	Difficult queuing simulation problems: simulating M/G/1 queues with heavy-tailed service.	WSC	2002	DBLP DOI BibTeX RDF
15	Roberto Szechtman, Peter W. Glynn	Difficult queuing simulation problems: rare-event simulation for infinite server queues.	WSC	2002	DBLP DOI BibTeX RDF
15	Bruce Shultes	Difficult queuing simulation problems: a balanced likelihood ratio approach for analyzing rare events in a tandem Jackson network.	WSC	2002	DBLP DOI BibTeX RDF
15	Eckart Zitzler, Marco Laumanns, Lothar Thiele, Carlos M. Fonseca, Viviane Grunert da Fonseca	Why Quality Assessment Of Multiobjective Optimizers Is Difficult.	GECCO	2002	DBLP BibTeX RDF
15	Abhishek Singh, David E. Goldberg, Ying-Ping Chen	Modified Linkage Learning Genetic Algorithm For Difficult Non-stationary Problems.	GECCO	2002	DBLP BibTeX RDF
15	Abhishek Singh, David E. Goldberg, Ying-Ping Chen	Modified Linkage Learning Genetic Algorithm for Difficult Non-Stationary Problems.	GECCO Late Breaking Papers	2002	DBLP BibTeX RDF
15	David A. Bell, David H. Glass	Evaluating Evidence When Making Difficult Decisions.	IC-AI	2002	DBLP BibTeX RDF
15	Matthieu Devin	Web Services and XML Good News: The Difficult Issues Are Still Open.	WECWIS	2002	DBLP DOI BibTeX RDF
15	Robert S. Chappell, Francis Tseng, Yale N. Patt, Adi Yoaz	Difficult-Path Branch Prediction Using Subordinate Microthreads.	ISCA	2002	DBLP DOI BibTeX RDF	high performance microprocessor, SSMT, microthread, branch prediction, microarchitecture, SMT, helper thread
15	Roland Borch Hougs	Practical and efficient techniques for irradiance estimation in difficult lighting conditions.		2002	RDF
15	Mohammad Moinul Islam	Robust Face Representation and Recognition Under Low Resolution and Difficult Lighting Conditions.		2002	RDF
15	Han Hoogeveen, Gerhard J. Woeginger	A very difficult scheduling problem with communication delays.	Oper. Res. Lett.	2001	DBLP DOI BibTeX RDF
15	Maurice Margenstern	Two railway circuits: a universal circuit and an NP-difficult one.	Comput. Sci. J. Moldova	2001	DBLP BibTeX RDF
15	Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar	Computing the order of points on an elliptic curve modulo N is as difficult as factoring N.	Appl. Math. Lett.	2001	DBLP DOI BibTeX RDF