Sciweavers

940 search results - page 64 / 188
» Control Abstractions for Local Search
Sort
View
128
Voted
AAAI
2004
15 years 5 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
119
Voted
GECCO
2004
Springer
15 years 9 months ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer
119
Voted
CSE
2009
IEEE
15 years 10 months ago
Noise Injection for Search Privacy Protection
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...
Shaozhi Ye, Shyhtsun Felix Wu, Raju Pandey, Hao Ch...
CP
2000
Springer
15 years 8 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
COLCOM
2008
IEEE
15 years 10 months ago
Collaborative Search and User Privacy: How Can They Be Reconciled?
Abstract. Collaborative search engines (CSE) let users pool their resources and share their experiences when seeking information on the web. However, when shared, search terms and ...
Thorben Burghardt, Erik Buchmann, Klemens Böh...