Sciweavers

1566 search results - page 199 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
AAAI
2010
13 years 9 months ago
Stackelberg Voting Games: Computational Aspects and Paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can...
Lirong Xia, Vincent Conitzer
IPSN
2004
Springer
14 years 1 months ago
Constraint-guided dynamic reconfiguration in sensor networks
This paper presents an approach for dynamic software reconfiguration in sensor networks. Our approach utilizes explicit models of the design space of the embedded application. The...
Sachin Kogekar, Sandeep Neema, Brandon Eames, Xeno...
ANCS
2008
ACM
13 years 10 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
13 years 12 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
DCC
1998
IEEE
14 years 6 days ago
Multiple Pattern Matching in LZW Compressed Text
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Mas...