Sciweavers

986 search results - page 51 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
ATAL
2010
Springer
13 years 9 months ago
To teach or not to teach?: decision making under uncertainty in ad hoc teams
In typical multiagent teamwork settings, the teammates are either programmed together, or are otherwise provided with standard communication languages and coordination protocols. ...
Peter Stone, Sarit Kraus
ICALP
2011
Springer
12 years 11 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 8 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
CP
2009
Springer
14 years 8 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
GPCE
2008
Springer
13 years 9 months ago
Generating incremental implementations of object-set queries
High-level query constructs help greatly improve the clarity of programs and the productivity of programmers, and are being introduced to increasingly more languages. However, the...
Tom Rothamel, Yanhong A. Liu