1139 search results - page 53 / 228 » Bounded Ideation Theory |
140
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
174
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
133
click to vote
FORTE
2008
15 years 5 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
114
click to vote
AAAI
1998
15 years 5 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
178
click to vote
DIALM
2003
ACM
15 years 9 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...