Sciweavers

4526 search results - page 514 / 906
» Algorithmic problems related to the Internet
Sort
View
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
15 years 8 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
EVOW
2008
Springer
15 years 8 months ago
Particle Swarm Optimization for Tackling Continuous Review Inventory Models
We propose an alternative algorithm for solving continuous review inventory model problems for deteriorating items over a finite horizon. Our interest focuses on the case of timeā...
Konstantinos E. Parsopoulos, K. Skouri, Michael N....
195
Voted
TON
2008
125views more  TON 2008»
15 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
191
Voted
PODC
2006
ACM
16 years 24 days ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
205
Voted
ML
2002
ACM
123views Machine Learning» more  ML 2002»
15 years 6 months ago
Feature Generation Using General Constructor Functions
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
Shaul Markovitch, Dan Rosenstein