Sciweavers

8496 search results - page 99 / 1700
» Problem Solving and Complex Systems
Sort
View
CP
2009
Springer
16 years 5 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
AUTOMATICA
2006
137views more  AUTOMATICA 2006»
15 years 4 months ago
A Newton-like method for solving rank constrained linear matrix inequalities
This paper presents a Newton-like algorithm for solving systems of rank constrained linear matrix inequalities. Though local quadratic convergence of the algorithm is not a priori...
Robert Orsi, Uwe Helmke, John B. Moore
TCS
2008
15 years 4 months ago
Solving difference equations whose coefficients are not transcendental
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
Manuel Kauers
MATES
2005
Springer
15 years 10 months ago
The Distributed Weighing Problem: A Lesson in Cooperation Without Communication
Abstract. Cooperative problem solving without communication is an oftenstudied field within multi-agent research. Realistic problems investigated in this particular field are compl...
Tibor Bosse, Mark Hoogendoorn, Catholijn M. Jonker
EVOW
2009
Springer
15 years 11 months ago
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
Zhi-hui Zhan, Jun Zhang