Sciweavers

69 search results - page 10 / 14
» Characterizing strong normalization in a language with contr...
Sort
View
AAAI
2004
13 years 9 months ago
Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
Alexandre Albore, Piergiorgio Bertoli
CP
2005
Springer
14 years 1 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
SPE
2002
115views more  SPE 2002»
13 years 7 months ago
D'Agents: Applications and performance of a mobile-agent system
D'Agents is a general-purpose mobile-agent system that has been used in several informationretrieval applications. In this paper, we first examine one such application, opera...
Robert S. Gray, George Cybenko, David Kotz, Ronald...
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
13 years 2 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
TLCA
2005
Springer
14 years 1 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird