192 search results - page 38 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
SPAA
1999
ACM
14 years 2 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
ICDCS
2005
IEEE
14 years 3 months ago
2005
IEEE
We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossipbased protocol using adaptive fanout. We model three versions of go...
AAAI
2000
13 years 11 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...