518 search results - page 55 / 104 » Beating a Random Assignment |
127
Voted
GLVLSI
2007
IEEE
15 years 9 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
109
Voted
SAT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
119
click to vote
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
Robust video streaming over error-prone wireless LANs (WLANs) poses many challenges. In this paper, we propose a timestamp-based content-aware adaptive retry (CAR) mechanism for M...
117
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
133
Voted
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...