3229 search results - page 372 / 646 » The Theory of Timed Automata |
186
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
172
click to vote
SSWMC
2004
15 years 8 months ago
2004
This paper deals with the problem of synchronization in the particular case of audio data hiding. In this kind of application the goal is to increase the information of an audio d...
173
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we study, for the first time explicitly, the implications of endowing an interested party (i.e. a teacher) with the ability to modify the underlying dynamics of the ...
219
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
153
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...