Sciweavers

1963 search results - page 303 / 393
» The Maximum Solution Problem on Graphs
Sort
View
PPSN
1998
Springer
14 years 2 months ago
A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
Marco Laumanns, Günter Rudolph, Hans-Paul Sch...
SIROCCO
2004
13 years 11 months ago
Time Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
Leszek Gasieniec, Igor Potapov, Qin Xin
AIPS
2000
13 years 11 months ago
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
Minh Binh Do, Biplav Srivastava, Subbarao Kambhamp...
MP
2002
85views more  MP 2002»
13 years 9 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
WEBI
2010
Springer
13 years 7 months ago
Hierarchical Cost-Sensitive Web Resource Acquisition for Record Matching
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
Yee Fan Tan, Min-Yen Kan