9119 search results - page 164 / 1824 » A Simultaneous Search Problem |
110
Voted
CPAIOR
2007
Springer
15 years 7 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...
104
click to vote
ACNS
2008
Springer
15 years 3 months ago
2008
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
112
Voted
AMAI
1999
Springer
15 years 24 days ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
119
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
115
Voted
STTT
2008
15 years 1 months ago
2008
Abstract This paper is about tool support for knowledgeintensive engineering tasks. In particular, it introduces software technology to assist the design of complex technical syste...