Sciweavers

3433 search results - page 245 / 687
» Heuristics for a bidding problem
Sort
View
MP
1998
105views more  MP 1998»
15 years 6 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
CN
2006
104views more  CN 2006»
15 years 6 months ago
Slot allocation schemes for delay sensitive traffic support in asynchronous wireless mesh networks
Heterogeneous multihop wireless networks such as wireless mesh networks consist of a set of resource-constrained mobile nodes that want to communicate with each other and a set of...
V. Vidhyashankar, B. S. Manoj, C. Siva Ram Murthy
JAIR
2010
167views more  JAIR 2010»
15 years 5 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
16 years 6 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
ANOR
2011
175views more  ANOR 2011»
15 years 1 months ago
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
Fred Glover, Lawrence H. Cox, Rahul Patil, James P...