6455 search results - page 83 / 1291 » Research problems |
246
Voted
EMO
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
123
Voted
AAAI
2008
15 years 4 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
139
Voted
COMPULOG
1999
Springer
15 years 6 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
106
Voted
WSC
1998
15 years 3 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
105
click to vote
RANLP
2003
15 years 3 months ago
2003
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...