1102 search results - page 127 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
136
Voted
ECAI
1992
Springer
15 years 4 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
110
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, the merging of tw...
76
Voted
IAT
2009
IEEE
15 years 7 months ago
2009
IEEE
We address the problem of multi-UAV surveillance in complex urban environments with occlusions. The problem consists of coordinating the flight of UAVs with on-board cameras so t...
CORR
2008
Springer
15 years 21 days ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
127
click to vote
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...