Sciweavers

2503 search results - page 392 / 501
» A study of 3-arc graphs
Sort
View
128
Voted
AAAI
1994
15 years 7 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
135
Voted
4OR
2007
103views more  4OR 2007»
15 years 5 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti
172
Voted
ALGORITHMICA
2008
110views more  ALGORITHMICA 2008»
15 years 5 months ago
Bandwidth-Constrained Allocation in Grid Computing
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
Anshul Kothari, Subhash Suri, Yunhong Zhou
164
Voted
DAM
2008
103views more  DAM 2008»
15 years 5 months ago
Crown reductions for the Minimum Weighted Vertex Cover problem
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
Miroslav Chlebík, Janka Chlebíkov&aa...
140
Voted
DM
2008
97views more  DM 2008»
15 years 5 months ago
On uniquely k-determined permutations
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
Sergey V. Avgustinovich, Sergey Kitaev