5316 search results - page 131 / 1064 » Which Search Problems Are Random |
112
Voted
ANOR
2002
15 years 3 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
165
click to vote
SOCO
2012
Springer
13 years 11 months ago
2012
Springer
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
143
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
129
click to vote
ISTCS
1993
Springer
15 years 7 months ago
1993
Springer
d Abstract) David P. Anderson Nimrod Megiddoy Moni Naorz April 1993 The \Minimum Reservation Rate Problem" arises in distributed systems for handling digital audio and video d...
132
click to vote
PERCOM
2008
ACM
15 years 3 months ago
2008
ACM
In this paper, we introduce a randomized bit encoding scheme that can strengthen the privacy protection on RFID tags. This scheme is used together with the backward channel protec...