2168 search results - page 256 / 434 » Randomized Algorithms and Complexity Theory |
141
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
130
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in a...
133
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
111
Voted
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
Statistical timing analysis has been widely applied to predict the timing yield of VLSI circuits when process variations become significant. Existing statistical latch timing met...
121
Voted
ICN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...