15033 search results - page 301 / 3007 » Complexity Theory and Algorithms |
134
Voted
FUIN
2008
15 years 5 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
142
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
158
click to vote
SIGECOM
2008
ACM
15 years 5 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
146
click to vote
DAC
2006
ACM
16 years 6 months ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
131
Voted
CSE
2009
IEEE
15 years 8 months ago
2009
IEEE
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...