Sciweavers

2100 search results - page 146 / 420
» Fundamentals of the problem
Sort
View
167
Voted
FSTTCS
2010
Springer
15 years 4 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
ICML
2009
IEEE
16 years 7 months ago
Trajectory prediction: learning to map situations to robot trajectories
Trajectory planning and optimization is a fundamental problem in articulated robotics. Algorithms used typically for this problem compute optimal trajectories from scratch in a ne...
Nikolay Jetchev, Marc Toussaint
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 7 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
JDA
2006
184views more  JDA 2006»
15 years 6 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
142
Voted
ICCV
2005
IEEE
15 years 11 months ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu