16504 search results - page 193 / 3301 » New Problems, New Solutions |
181
click to vote
IJCAI
1993
15 years 7 months ago
1993
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
158
click to vote
JAIR
2008
15 years 6 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
145
click to vote
BPM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this work we introduce a new generalization of the ResourceConstrained Project Scheduling Problem – the Mobile Workforce Scheduling Problem with Multitask-Processes ...
181
click to vote
ASIAMS
2007
IEEE
16 years 26 days ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
137
click to vote
COCO
2004
Springer
15 years 12 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...