Sciweavers

193 search results - page 14 / 39
» Partial Solutions with Unique Completion
Sort
View
ESWS
2004
Springer
14 years 28 days ago
Directory Services for Incremental Service Integration
Abstract. In an open environment populated by heterogeneous information services integration will be a major challenge. Even if the problem is similar to planning in some aspects, ...
Ion Constantinescu, Walter Binder, Boi Faltings
ESOP
2001
Springer
14 years 1 days ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
FOSSACS
2010
Springer
14 years 2 months ago
CIA Structures and the Semantics of Recursion
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
Stefan Milius, Lawrence S. Moss, Daniel Schwencke
IAT
2007
IEEE
13 years 11 months ago
A Unified Framework Based on HTN and POP Approaches for Multi-Agent Planning
The purpose of this paper is to introduce a multi-agent model for plan synthesis in which the production of a global shared plan is based on a promising unified framework based on...
Damien Pellier, Humbert Fiorino
DAM
1999
132views more  DAM 1999»
13 years 7 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian