Sciweavers

2107 search results - page 304 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
FCCM
2006
IEEE
133views VLSI» more  FCCM 2006»
14 years 3 months ago
A Scalable FPGA-based Multiprocessor
It has been shown that a small number of FPGAs can significantly accelerate certain computing tasks by up to two or three orders of magnitude. However, particularly intensive lar...
Arun Patel, Christopher A. Madill, Manuel Salda&nt...
CPAIOR
2010
Springer
14 years 1 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
4OR
2010
148views more  4OR 2010»
13 years 7 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 4 months ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro
AIPS
2003
13 years 10 months ago
Decision-Theoretic Group Elevator Scheduling
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
Daniel Nikovski, Matthew Brand