2446 search results - page 202 / 490 » Choiceless Polynomial Time |
148
click to vote
COLT
1993
Springer
15 years 8 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
155
click to vote
CAV
2001
Springer
15 years 7 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
157
click to vote
JCO
2006
15 years 3 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
119
Voted
ICARIS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
117
Voted
ASPDAC
2004
ACM
15 years 7 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...