Sciweavers

8413 search results - page 403 / 1683
» Ordering Problem Subgoals
Sort
View
CUZA
2002
132views more  CUZA 2002»
15 years 6 months ago
Agent-Client Interaction in a Web-Based E-Commerce System
In order for agent technology to fulfill its promise, it must be integrated with other existing technologies. In this paper we address one of the problems occurring in a real-world...
Minor Gordon, Marcin Paprzycki, Violetta Galant
LOGCOM
2011
14 years 9 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea
AIPS
2004
15 years 8 months ago
Optimal Resource Allocation and Policy Formulation in Loosely-Coupled Markov Decision Processes
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation pr...
Dmitri A. Dolgov, Edmund H. Durfee
MOR
2002
94views more  MOR 2002»
15 years 6 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
ALGORITHMICA
2011
15 years 1 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick