Sciweavers

2095 search results - page 344 / 419
» Improved pebbling bounds
Sort
View
AIPS
2007
14 years 9 days ago
Online Planning for Resource Production in Real-Time Strategy Games
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chri...
USENIX
2008
14 years 9 days ago
A Compacting Real-Time Memory Management System
We propose a real real-time memory management system called Compact-fit that offers both time and space predictability. Compact-fit is a compacting memory management system for al...
Silviu S. Craciunas, Christoph M. Kirsch, Hannes P...
WSC
2008
14 years 9 days ago
Reliable simulation with input uncertainties using an interval-based approach
Uncertainty associated with input parameters and models in simulation has gained attentions in recent years. The sources of uncertainties include lack of data and lack of knowledg...
Ola Ghazi Batarseh, Yan Wang
CVPR
2010
IEEE
14 years 11 hour ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
14 years 5 hour ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen