Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Eric Schechter |
Constructivism Is Difficult. |
Am. Math. Mon. |
2001 |
DBLP BibTeX RDF |
|
15 | Jason M. Daida, Robert R. Bertram, Stephen A. Stanhope, Jonathan C. Khoo, Shahbaz A. Chaudhary, Omer A. Chaudhri, John Polito |
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. |
Genet. Program. Evolvable Mach. |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Anders J. Killander |
Why design methodologies are difficult to implement. |
Int. J. Technol. Manag. |
2001 |
DBLP DOI BibTeX RDF |
|
15 | James McDonald |
Why Is Software Project Management Difficult? And What That Implies for Teaching Software Project Management. |
Comput. Sci. Educ. |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Marco Dorigo |
Ant Algorithms Solve Difficult Optimization Problems. |
ECAL |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Daniel E. Callan, Keiichi Tajima, Akiko E. Callan, Reiko Akahane-Yamada, Shinobu Masaki |
Neural processes underlying perceptual learning of a difficult second language phonetic contrast. |
INTERSPEECH |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Qun Li, Martin J. Russell |
Why is automatic recognition of children's speech difficult? |
INTERSPEECH |
2001 |
DBLP DOI BibTeX RDF |
|
15 | William Fone |
Using a familiar package to demonstrate a difficult concept: using an excel spreadsheet model to explain the concepts of neural networks to undergraduates. |
ITiCSE |
2001 |
DBLP DOI BibTeX RDF |
CAL tools, computer anxiety, neural networks, constructivist |
15 | Kolja Sulimma, Wolfgang Kunz |
An exact algorithm for solving difficult detailed routing problems. |
ISPD |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Xiaodong Wang, Qingxin Meng |
A novel system for underwater docking in difficult situations. |
CIRA |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Jarinee Chattratichart, Jasna Kuljis |
Why Diagrams Are Sometimes Difficult. |
INTERACT |
2001 |
DBLP BibTeX RDF |
|
15 | Antonio Bicchi |
Hands for dexterous manipulation and robust grasping: a difficult road toward simplicity. |
IEEE Trans. Robotics Autom. |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Marina M. Pool, Tom H. A. Van Der Voort, Johannes W. J. Beentjes, Cees M. Koolstra |
Background Television as an Inhibitor of Performance on Easy and Difficult Homework Assignments. |
Commun. Res. |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Nancy R. Mead |
Why is it so Difficult to Introduce Requirements Engineering Research Results into Mainstream Requirements Engineering Practice? |
ICRE |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Hermann Kaindl |
Why is it so Difficult to Introduce Requirements Engineering Research Results into Mainstream Requirements Engineering Practice? |
ICRE |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Carlos Cabral-Cardoso |
A bridge over troubled water. The difficult crossing from academia to the 'real world' of industry. |
ISTAS |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Tiziana Catarci, Giacinto Matarazzo, Gianluigi Raiss |
Usability and public administration: experiences of a difficult marriage. |
CUU |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Hermann Kaindl, Karl Frank, Ivar Jacobson, Stephen J. Mellor, Joaquin Miller, Laura Hill |
How difficult is the transition from OOA to OOD? (panel session). |
OOPSLA Addendum |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Hamid R. Berenji, David Vengerov |
Advantages of cooperation between reinforcement learning agents in difficult stochastic problems. |
FUZZ-IEEE |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Pieter-Tjerk de Boer, Victor F. Nicola, Reuven Y. Rubinstein |
Techniques for simulating difficult queueing problems: adaptive importance sampling simulation of queueing networks. |
WSC |
2000 |
DBLP DOI BibTeX RDF |
|
15 | J. Ángel Velázquez-Iturbide |
Recursion in gradual steps (is recursion really that difficult?). |
SIGCSE |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Leszek Pacholski |
Tutoriel II: Is it difficult to solve equations in the algebra of words. |
JFPLC |
2000 |
DBLP BibTeX RDF |
|
15 | Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo, Wendell S. Richardsons, Rachel Harrison, William J. Sloat |
Characterizing a Tunably Difficult Problem in Genetic Programming. |
GECCO |
2000 |
DBLP BibTeX RDF |
|
15 | Yang Xiang 0004, Tongsheng Chu |
Parallel Learning of Belief Networks in Large and Difficult Domains. |
Data Min. Knowl. Discov. |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Francisco Casacuberta, Colin de la Higuera |
Optimal linguistic decoding is a difficult computational problem. |
Pattern Recognit. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Timothy L. McDaniels, William Trousdale |
Value-Focused Thinking in a Difficult Context: Planning Tourism for Guimaras, Philippines. |
Interfaces |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Jason M. Daida, John Polito, Steven A. Stanhope, Robert R. Bertram, Jonathan C. Khoo, Shahbaz A. Chaudhary |
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. |
GECCO |
1999 |
DBLP BibTeX RDF |
|
15 | Brian Cloteaux, Christoph F. Eick, Bernadette Bouchon-Meunier, Vladik Kreinovich |
From ordered beliefs to numbers: How to elicit numbers without asking for them (doable but computationally difficult). |
Int. J. Intell. Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Tobias Rydén |
Optimal Overload Control of Systems with Access Buffers - a Difficult Problem. |
Comput. Networks |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Jonathan P. Caulkins, Edward H. Kaplan, Peter Lurie, Thomas O'Connor, Sung-Ho Ahn |
Can Difficult-to-Reuse Syringes Reduce the Spread of HIV Among Injection Drug Users? |
Interfaces |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Olivier Devillers |
Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems |
CoRR |
1998 |
DBLP BibTeX RDF |
|
15 | David Preston |
What makes professionals so difficult: an investigation into professional ethics teaching. |
SIGCAS Comput. Soc. |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Enric Celaya, Josep M. Porta |
A control structure for the locomotion of a legged robot on difficult terrain. |
IEEE Robotics Autom. Mag. |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Barbara Hammer |
Training a sigmoidal network is difficult. |
ESANN |
1998 |
DBLP BibTeX RDF |
|
15 | Igor Walukiewicz |
Difficult Configurations - On the Complexity of LTrL. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
15 | David Preston |
What makes professionals so difficult: an investigation into professional ethics teaching. |
ACM Policy |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Leslie Barden |
Dealing with Difficult Customers - the Most Fun You Can Have at Work. |
SIGUCCS |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Michael Streit |
Why Are Multimodal Systems so Difficult to Build? - About the Difference between Deictic Gestures and Direct Manipulation. |
Cooperative Multimodal Communication |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Stephen J. Alter |
Solving Difficult Grid Related Problems Utilizing the Volume Grid Manipulator. |
IMR |
1998 |
DBLP BibTeX RDF |
|
15 | Md. Shoaib Bhuiyan, Yuji Iwahori, Akira Iwata |
Optimal Edge Detection under Difficult Imaging Conditions. |
ACCV (2) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Thang C. Nguyen |
Robust, Automatic Structural Analysis of Difficult Face Images: A New Approach |
|
1998 |
RDF |
|
15 | Jinwoo Kim, F. Javier Lerch |
Why Is Programming (Sometimes) So Difficult? Programming as Scientific Discovery in Multiple Problem Spaces. |
Inf. Syst. Res. |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Alberto Caprara |
Sorting by reversals is difficult. |
RECOMB |
1997 |
DBLP DOI BibTeX RDF |
alternating cycle decomposition, complexity, sorting by reversals |
15 | Chris Fennessy |
If We Can Land A Man on the Moon Why is it so Difficult to Run and support a Data Centre? |
Int. CMG Conference |
1997 |
DBLP BibTeX RDF |
|
15 | Robert Moser |
A fantasy adventure game as a learning environment: why learning to program is so difficult and what can be done about it. |
ITiCSE |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Sally C. Brailsford, Peter M. Hubbard, Barbara M. Smith, H. Paul Williams |
Organizing a social event - A difficult problem of combinatorial optimization. |
Comput. Oper. Res. |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Kate Finney |
Mathematical Notation in Formal Specification: Too Difficult for the Masses? |
IEEE Trans. Software Eng. |
1996 |
DBLP DOI BibTeX RDF |
reading Z, Formal specification, mathematics |
15 | Charles Cresson Wood |
Constructing difficult-to-guess passwords. |
Inf. Manag. Comput. Secur. |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Nigel P. Smart |
How Difficult Is It to Solve a Thue Equation? |
ANTS |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Grigory Kogan |
Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
fields of characteristic 3, computational complexity, complexity, polynomial time algorithm, polynomial-time algorithm, matrix, permanents |
15 | Irfan A. Essa |
Vision-Based HCI - What's Next and What are the Difficult Problems? |
FG |
1996 |
DBLP BibTeX RDF |
|
15 | Kokichi Sugihara, Hiroshi Inagaki |
Why is the 3D Delaunay Triangulation Difficult to Construct. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Aart Middeldorp, Bernhard Gramlich |
Simple termination is difficult. |
Appl. Algebra Eng. Commun. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Andreja Prijatelj |
Reflections on "difficult" embeddings. |
J. Philos. Log. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Sheldon H. Jacobson |
How difficult is the frequency selection problem? |
Oper. Res. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Bienstock, Oktay Günlük |
Computational experience with a difficult mixed-integer multicommodity flow problem. |
Math. Program. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | D. J. Andrews, Darrel C. Ince |
A case study of a difficult refinement: a fast dictionary for a spell-checking program. |
Inf. Softw. Technol. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Klaus G. Troitzsch |
Computer Simulation and Social Sciences: On the Future of a Difficult Relation. |
Social Science Microsimulation |
1995 |
DBLP BibTeX RDF |
|
15 | Cristiana Bolchini, Franco Fummi, R. Gemelli, Fabio Salice |
A BDD Based Algorithm for Detecting Difficult Faults. |
ISCAS |
1995 |
DBLP BibTeX RDF |
|
15 | Steve M. Easterbrook |
Coordination breakdowns: why groupware is so difficult to design. |
HICSS (4) |
1995 |
DBLP DOI BibTeX RDF |
coordination breakdowns, group interaction complexity, software support tool requirements, analysis techniques, collaboration, groupware, human factors, conflict, group support systems, user adaptability, organisational change, groupware design, shared understanding, interaction mechanisms |
15 | Barbara M. Smith |
In Search of Exceptionally Difficult Constraint Satisfaction Problems. |
Constraint Processing, Selected Papers |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Tsungnan Lin, Bill G. Horne, Peter Tiño, C. Lee Giles |
Learning long-term dependencies is not as difficult with NARX networks. |
NIPS |
1995 |
DBLP BibTeX RDF |
|
15 | Astro Teller, Manuela M. Veloso |
A Contolled Experiment: Evolution for Learning Difficult Image Classification. |
EPIA |
1995 |
DBLP DOI BibTeX RDF |
|
15 | John R. Podlena, Tim Hendtlass |
Using a Combination of Genetic Algorithm and Hill Climbing Techniques for the Solution of a Difficult Letter Recognition Problem. |
IEA/AIE |
1995 |
DBLP BibTeX RDF |
|
15 | Jan Kratochvíl |
Regular codes in regular graphs are difficult. |
Discret. Math. |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Yoshua Bengio, Patrice Y. Simard, Paolo Frasconi |
Learning long-term dependencies with gradient descent is difficult. |
IEEE Trans. Neural Networks |
1994 |
DBLP DOI BibTeX RDF |
|
15 | John Budenske, Maria L. Gini |
Why Is It So Difficult for a Robot to Pass Through a Doorway Using Ultrasonic Sensors? |
ICRA |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Gernot Starke |
Why is Process Modelling so Difficult? |
EWSPT |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Edward M. Roche, Michael Blaine |
Public Policy and Information Technology in the Developing World: Difficult Financial Options. |
IFIP Congress (3) |
1994 |
DBLP BibTeX RDF |
|
15 | Marc S. Atkin, Paul R. Cohen |
Learning Monitoring Strategies: A Difficult Genetic Programming Application. |
International Conference on Evolutionary Computation |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Kurt Konolige |
Easy to be Hard: Difficult Problems for Greedy Algorithms. |
KR |
1994 |
DBLP BibTeX RDF |
|
15 | Wieslaw Kubiak |
Completion time variance minimization on a single machine is difficult. |
Oper. Res. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Janez Zerovnik |
Regular Graphs Are 'Difficult' For Colouring. |
Informatica (Slovenia) |
1993 |
DBLP BibTeX RDF |
|
15 | Yohei Yamasaki |
Shannon-like games are difficult. |
Discret. Math. |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Maria J. Castro, Juan C. Perez |
Comparison of geometric, connections and structural techniques on a difficult isolated word recognition task. |
EUROSPEECH |
1993 |
DBLP DOI BibTeX RDF |
|
15 | David E. Goldberg, Kalyanmoy Deb, Hillol Kargupta, Georges R. Harik |
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms. |
ICGA |
1993 |
DBLP BibTeX RDF |
|
15 | Michael R. Fellows, Michael T. Hallett, Harold T. Wareham |
DNA Physical Mapping: Three Ways Difficult. |
ESA |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Aart Middeldorp, Bernhard Gramlich |
Simple Termination is Difficult. |
RTA |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Olivier Devillers |
Randomization yields simple O(n log* n) algorithms for difficult Omega(n) problems. |
Int. J. Comput. Geom. Appl. |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Richard Rankin, Ralph W. Wilkerson |
Proving functionally difficult problems through model generation. |
SAC |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Enver Yücesan, Sheldon H. Jacobson |
Building Correct Simulation Models is Difficult. |
WSC |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Michael E. Palmer, Stephen J. Smith |
Improved Evolutionary Optimization of Difficult Landscapes: Control of Premature Convergence through Scheduled Sharing. |
Complex Syst. |
1991 |
DBLP BibTeX RDF |
|
15 | Jonathan Schaeffer |
A Difficult Search Problem. |
J. Int. Comput. Games Assoc. |
1991 |
DBLP DOI BibTeX RDF |
|
15 | Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard |
A GRASPTM for a difficult single machine scheduling problem, . |
Comput. Oper. Res. |
1991 |
DBLP DOI BibTeX RDF |
|
15 | J. A. Hoogeveen |
Analysis of Christofides' heuristic: Some paths are more difficult than cycles. |
Oper. Res. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
15 | Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan |
An interior point algorithm to solve computationally difficult set covering problems. |
Math. Program. |
1991 |
DBLP DOI BibTeX RDF |
|
15 | Mark S. Fox, Norman M. Sadeh |
Why is Scheduling Difficult? A CSP Perspective. |
ECAI |
1990 |
DBLP BibTeX RDF |
|
15 | C. Shim, B. Espinoza-Varas, J. Y. Cheung |
A PC-based neural network for recognition of difficult syllables using LPC coefficient difference. |
IJCNN |
1990 |
DBLP DOI BibTeX RDF |
|
15 | Gábor Tardos |
Query complexity, or why is it difficult to seperate NP A cap co NPA from PA by random oracles A?. |
Comb. |
1989 |
DBLP DOI BibTeX RDF |
|
15 | Anne Cutler, Sally Butterfield |
Natural speech cues to word segmentation under difficult listening conditions. |
EUROSPEECH |
1989 |
DBLP DOI BibTeX RDF |
|
15 | E.-L. Bogue |
The difficult client: consulting techniques from the human services. |
SIGUCCS |
1989 |
DBLP DOI BibTeX RDF |
|
15 | Lee Shiflett |
A difficult balance: Editorial peer review in medicine. |
J. Am. Soc. Inf. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
15 | Milan Ninchich |
Database Draw - Too Difficult? |
J. Int. Comput. Games Assoc. |
1988 |
DBLP DOI BibTeX RDF |
|
15 | Lajos Rónyai |
Simple Algebras Are Difficult |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
15 | Kathleen Brush |
Managing Computer Center Resources: A Task No More Difficult Than Minding the Store. |
Int. CMG Conference |
1986 |
DBLP BibTeX RDF |
|
15 | Imre Bárány, Zoltán Füredi |
Computing the Volume Is Difficult |
STOC |
1986 |
DBLP DOI BibTeX RDF |
|
15 | Bahman Kalantari |
Technical Note - Construction of Difficult Linearly Constrained Concave Minimization Problems. |
Oper. Res. |
1985 |
DBLP DOI BibTeX RDF |
|
15 | David A. Bell |
Difficult Data Placement Problems. |
Comput. J. |
1984 |
DBLP DOI BibTeX RDF |
|
15 | Andrew G. Barto, Richard S. Sutton, Charles W. Anderson |
Neuronlike adaptive elements that can solve difficult learning control problems. |
IEEE Trans. Syst. Man Cybern. |
1983 |
DBLP DOI BibTeX RDF |
|
15 | John R. Kender |
Why Perspective Is Difficult: How Two Algorithms Fail. |
AAAI |
1982 |
DBLP BibTeX RDF |
|