Sciweavers

484 search results - page 92 / 97
» The number of convex permutominoes
Sort
View
IJAR
2008
78views more  IJAR 2008»
13 years 7 months ago
A survey of the theory of coherent lower previsions
This paper presents a summary of Peter Walley's theory of coherent lower previsions. We introduce three representations of coherent assessments: coherent lower and upper prev...
Enrique Miranda
MP
2008
135views more  MP 2008»
13 years 7 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
TROB
2008
96views more  TROB 2008»
13 years 7 months ago
On Discrete-Time Pursuit-Evasion Games With Sensing Limitations
We address discrete-time pursuit-evasion games in the plane where every player has identical sensing and motion ranges restricted to closed discs of given sensing and stepping rad...
Shaunak Dattaprasad Bopardikar, Francesco Bullo, J...
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 11 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
4OR
2010
137views more  4OR 2010»
13 years 7 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...