614 search results - page 29 / 123 » Computational Complexity of Multi-way, Dataflow Constraint P... |
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
JAPLL
2010
13 years 6 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
SIGECOM
2003
ACM
14 years 1 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
ICCNMC
2005
Springer
14 years 1 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
SAS
2001
Springer
14 years 8 days ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...