Sciweavers

2397 search results - page 38 / 480
» Applications of integer relation algorithms
Sort
View
CP
2004
Springer
14 years 4 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 11 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
DAWAK
2010
Springer
14 years 2 days ago
Discovery and Application of Functional Dependencies in Conjunctive Query Mining
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
Bart Goethals, Dominique Laurent, Wim Le Page
JAIR
2006
74views more  JAIR 2006»
13 years 11 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
WSC
2001
14 years 10 days ago
On improving the performance of simulation-based algorithms for average reward processes with application to network pricing
We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...
Enrique Campos-Náñez, Stephen D. Pat...