2752 search results - page 9 / 551 » Rounding to an Integral Program |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
DATE
2008
IEEE
14 years 3 months ago
2008
IEEE
Modern embedded CPU systems rely on a growing number of software features, but this growth increases the memory footprint and increases the need for efficient instruction and data...
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
WDAG
1990
Springer
14 years 19 days ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
AMS
2007
Springer
14 years 19 days ago
2007
Springer
Abstract. This paper proposes a novel architecture for the programming of multi-modal service robots and networked sensors. The presented software framework eases the development o...