Sciweavers

1263 search results - page 101 / 253
» A* with Bounded Costs
Sort
View
AI
2010
Springer
15 years 6 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
ECCC
2000
140views more  ECCC 2000»
15 years 6 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 6 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
SIAMJO
2010
155views more  SIAMJO 2010»
15 years 1 months ago
Optimal Portfolio Execution Strategies and Sensitivity to Price Impact Parameters
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
Somayeh Moazeni, Thomas F. Coleman, Yuying Li
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
16 years 6 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi