3428 search results - page 512 / 686 » Making the Case |
175
click to vote
SPAA
2005
ACM
16 years 2 days ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
171
click to vote
WS
2005
ACM
16 years 2 days ago
2005
ACM
The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main rea...
183
click to vote
ATAL
2005
Springer
16 years 2 days ago
2005
Springer
In this paper we combine existing work in the area of social laws with a framework for reasoning about knowledge in multi-agent systems. The unifying framework in which this is do...
225
click to vote
CAV
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
187
click to vote
STACS
2005
Springer
16 years 8 hour ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...