1480 search results - page 192 / 296 » Ants can solve constraint satisfaction problems |
178
click to vote
IJCAI
2003
15 years 8 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
180
click to vote
JAIR
2007
15 years 6 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
163
click to vote
PIMRC
2008
IEEE
16 years 28 days ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
169
click to vote
VISUALIZATION
1998
IEEE
15 years 10 months ago
1998
IEEE
We describe an aircraft design problem in high dimensional space, with D typically being 10 to 30. In some respects this is a classic optimization problem, where the goal is to fi...
156
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...