Sciweavers

835 search results - page 18 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
IPCO
2001
125views Optimization» more  IPCO 2001»
13 years 8 months ago
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
Jean B. Lasserre
IJCAI
2003
13 years 8 months ago
A Maximal Tractable Class of Soft Constraints
Many optimization problems can be expressed us­ ing some form of soft constraints, where different measures of desirability arc associated with differ­ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 6 months ago
Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...
Sheng Yang, Jean-Claude Belfiore
IAT
2009
IEEE
14 years 1 months ago
Optimization-Based Collision Avoidance for Cooperating Airplanes
Application of autonomous intelligent systems into airspace domain is very important nowadays. The paper presents decentralized collision avoidance algorithm utilizing a solution ...
David Sislák, Premysl Volf, Michal Pechouce...
LCTRTS
2004
Springer
14 years 3 days ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...