4679 search results - page 184 / 936 » Modeling When Connections Are the Problem |
190
Voted
IWPEC
2010
Springer
14 years 11 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
111
click to vote
HICSS
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper we consider the complete supply chain for a large pulp producer in Sweden. The supply chain is divided up in two parts, the pulp production planning problem and the ...
CI
2002
15 years 1 months ago
2002
As online markets for the exchange of goods and services become more common, the study of markets composed at least in part of autonomous agents has taken on increasing importance...
127
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
135
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...