Sciweavers

1086 search results - page 79 / 218
» Programming by Numbers: A Programming Method for Novices
Sort
View
CP
2005
Springer
15 years 11 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
NIPS
1996
15 years 7 months ago
Predicting Lifetimes in Dynamically Allocated Memory
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
David A. Cohn, Satinder P. Singh
MP
2008
135views more  MP 2008»
15 years 6 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
ICPR
2006
IEEE
16 years 7 months ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
ECCB
2008
IEEE
16 years 19 days ago
SIRENE: supervised inference of regulatory networks
Living cells are the product of gene expression programs that involve the regulated transcription of thousands of genes. The elucidation of transcriptional regulatory networks in ...
Fantine Mordelet, Jean-Philippe Vert