6455 search results - page 51 / 1291 » Research problems |
103
Voted
ECCC
2010
15 years 2 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
146
click to vote
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
122
click to vote
CIMCA
2005
IEEE
15 years 8 months ago
2005
IEEE
Research on the optimization of Vehicle Routing Problem with Time Windows (VRPTW) is a significant investigation area of ant colony system (ACS). This paper proposes an enhanced AC...
120
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
123
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...