Sciweavers

137 search results - page 13 / 28
» On the number of local minima for the multidimensional assig...
Sort
View
DISOPT
2011
210views Education» more  DISOPT 2011»
13 years 2 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
HYBRID
2007
Springer
13 years 11 months ago
Distributed Hybrid Control for Multiple-Pursuer Multiple-Evader Games
Multiple-pursuer multiple-evader games raise fundamental and novel problems in control theory and robotics. In this paper, we propose a distributed solution to this problem that si...
Michael M. Zavlanos, George J. Pappas
ICRA
2006
IEEE
111views Robotics» more  ICRA 2006»
14 years 1 months ago
Placement and Distributed Deployment of Sensor Teams for Triangulation based Localization
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
Volkan Isler
JCB
2006
126views more  JCB 2006»
13 years 7 months ago
Combinatorics of Saturated Secondary Structures of RNA
Following Zuker (1986), a saturated secondary structure for a given RNA sequence is a secondary structure such that no base pair can be added without violating the definition of s...
P. Clote
SETN
2004
Springer
14 years 1 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...