Sciweavers

989 search results - page 3 / 198
» Version spaces and the consistency problem
Sort
View
DAM
2010
79views more  DAM 2010»
13 years 7 months ago
On the sum minimization version of the online bin covering problem
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
János Csirik, Leah Epstein, Csanád I...
KCAP
2003
ACM
14 years 29 days ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
CCE
2004
13 years 7 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
DAM
2008
99views more  DAM 2008»
13 years 7 months ago
Boundary value problems on weighted networks
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...
Enrique Bendito, Angeles Carmona, Andrés M....
DEXAW
2002
IEEE
127views Database» more  DEXAW 2002»
14 years 20 days ago
Enhanced Multi-Version Data Broadcast Schemes for Time-Constrained Mobile Computing Systems
In this paper, we study the data dissemination problem in time-constrained mobile computing systems (TCMCS) in which maximizing data currency (minimizing staleness) and meeting tr...
Hei-Wing Leung, Joe Chun-Hung Yuen, Kam-yiu Lam, E...