Sciweavers

1998 search results - page 261 / 400
» Complexity of the Cover Polynomial
Sort
View
NOCS
2007
IEEE
16 years 25 days ago
Towards Open Network-on-Chip Benchmarks
Measuring and comparing performance, cost, and other features of advanced communication architectures for complex multi core/multiprocessor systems on chip is a significant challe...
Cristian Grecu, André Ivanov, Partha Pratim...
CSL
2001
Springer
15 years 11 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche
CP
2000
Springer
15 years 11 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
ATAL
1997
Springer
15 years 10 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche
FOCS
1993
IEEE
15 years 10 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch