Sciweavers

1984 search results - page 70 / 397
» The colourful feasibility problem
Sort
View
ICRA
2009
IEEE
161views Robotics» more  ICRA 2009»
14 years 4 months ago
Multi-vehicle path planning in dynamically changing environments
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
Ali Ahmadzadeh, Nader Motee, Ali Jadbabaie, George...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 10 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
IJCAI
1989
13 years 11 months ago
Constrained Heuristic Search
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
Mark S. Fox, Norman M. Sadeh, Can A. Baykan
SIAMCO
2010
153views more  SIAMCO 2010»
13 years 4 months ago
Optimal Control for an Elliptic System with Polygonal State Constraints
This work is devoted to stationary optimal control problems with polygonal constraints on the components of the state. Existence of Lagrange multipliers, of different regularity, i...
Karl Kunisch, Kewei Liang, Xiliang Lu
CEC
2009
IEEE
14 years 4 months ago
Constructing test problems for bilevel evolutionary multi-objective optimization
— Many real-world problems demand a feasible solution to satisfy physical equilibrium, stability, or certain properties which require an additional lower level optimization probl...
Kalyanmoy Deb, Ankur Sinha