Sciweavers

16504 search results - page 52 / 3301
» New Problems, New Solutions
Sort
View
DM
2008
58views more  DM 2008»
15 years 4 months ago
The vertex isoperimetric problem for the powers of the diamond graph
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
COGSCI
2004
77views more  COGSCI 2004»
15 years 4 months ago
Mapping visual attention with change blindness: new directions for a new method
Change blindness provides a new technique for mapping visual attention with unprecedented spatial and temporal resolution. Change blindness can occur when a brief full-field blank...
Peter U. Tse
CPAIOR
2004
Springer
15 years 10 months ago
Super Solutions in Constraint Programming
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
SIAMJO
2008
99views more  SIAMJO 2008»
15 years 4 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti
CP
2003
Springer
15 years 10 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin