Sciweavers

1274 search results - page 115 / 255
» N-fold integer programming
Sort
View
CP
2007
Springer
15 years 8 months ago
An LP-Based Heuristic for Optimal Planning
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
Menkes van den Briel, J. Benton, Subbarao Kambhamp...
111
Voted
IPPS
2006
IEEE
15 years 8 months ago
Solving generic role assignment exactly
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
Christian Frank, Kay Römer
IDA
2005
Springer
15 years 8 months ago
Miner Ants Colony: A New Approach to Solve a Mine Planning Problem
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
María-Cristina Riff, Michael Moossen, Xavie...
LCTRTS
2005
Springer
15 years 8 months ago
A sample-based cache mapping scheme
Applications running on the StrongARM SA-1110 or XScale processor cores can specify cache mapping for each virtual page to achieve better cache utilization. In this work, we descr...
Rong Xu, Zhiyuan Li
112
Voted
VMCAI
2005
Springer
15 years 8 months ago
Model Checking of Systems Employing Commutative Functions
Abstract. The paper presents methods for model checking a class of possibly infinite state concurrent programs using various types of bi-simulation reductions. The proposed method...
A. Prasad Sistla, Min Zhou, Xiaodong Wang