Sciweavers

614 search results - page 32 / 123
» Computational Complexity of Multi-way, Dataflow Constraint P...
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
E4MAS
2005
Springer
14 years 1 months ago
An Environment-Based Methodology to Design Reactive Multi-agent Systems for Problem Solving
Abstract. Even if the multi-agent paradigm has been evolving for fifteen years, the development of concrete methods for problem solving remains a major challenge. This paper focus...
Olivier Simonin, Franck Gechter
GLOBECOM
2006
IEEE
14 years 1 months ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 8 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
IPPS
2009
IEEE
14 years 2 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert