Sciweavers

834 search results - page 137 / 167
» A Decomposition Technique for Max-CSP
Sort
View
IJCAI
2001
13 years 11 months ago
Approximate inference for first-order probabilistic languages
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
Hanna Pasula, Stuart J. Russell
IJCAI
2001
13 years 11 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
WAE
2001
281views Algorithms» more  WAE 2001»
13 years 11 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
WSCG
2004
156views more  WSCG 2004»
13 years 11 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
WSC
1998
13 years 11 months ago
Timed Petri Nets as a Verification Tool
This paper presents Timed Petri Nets (TPN) as an analytical approach for verification of computerized queueing network simulation models at steady state. It introduces a generic a...
Miryam Barad