Sciweavers

2446 search results - page 333 / 490
» Choiceless Polynomial Time
Sort
View
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 6 months ago
Multitriangulations, pseudotriangulations and primitive sorting networks
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
Vincent Pilaud, Michel Pocchiola
EOR
2011
127views more  EOR 2011»
13 years 2 months ago
Methodology for determining the acceptability of system designs in uncertain environments
In practice, managers often wish to ascertain that a particular engineering design of a production system meets their requirements. The future environment of this design is likely...
Jack P. C. Kleijnen, Henri Pierreval, Jin Zhang
AGP
1994
IEEE
14 years 1 days ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
13 years 12 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 11 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...