415 search results - page 40 / 83 » An efficient approximation for the Generalized Assignment Pr... |
116
click to vote
ESANN
2001
15 years 2 months ago
2001
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
103
click to vote
PADS
1999
ACM
15 years 5 months ago
1999
ACM
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
STOC
2007
ACM
16 years 1 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
127
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
148
click to vote
ISPD
1997
ACM
15 years 5 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...