Sciweavers

1137 search results - page 76 / 228
» Partial Program Admission
Sort
View
AAAI
2004
13 years 11 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
13 years 11 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner
TPDS
2008
64views more  TPDS 2008»
13 years 10 months ago
Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems
Abstract-- Resource management systems (RMS) are an important component in heterogeneous computing (HC) systems. One of the jobs of an RMS is the mapping of arriving tasks onto the...
Issam Al-Azzoni, Douglas G. Down
REX
1989
14 years 2 months ago
METATEM: A Framework for Programming in Temporal Logic
In this paper we further develop the methodology of temporal logic as an executable imperative language, presented by Moszkowski [Mos86] and Gabbay [Gab87, Gab89] and present a con...
Howard Barringer, Michael Fisher, Dov M. Gabbay, G...
FLAIRS
2000
13 years 11 months ago
Domain Semantics for Agent-Oriented Programming
This paper describes a novel semantic framework for an agent architecture. Drawing on Shoham's work on AGENT0 (Shoham 1993), we replace Shoham's modal logic semantics wi...
Roger Norton, S. Rebecca Thomas