Sciweavers

2926 search results - page 275 / 586
» Partially Optimal Routing
Sort
View
ICIP
2005
IEEE
16 years 5 months ago
Featureless global alignment of multiple images
The majority of the approaches to the automatic recovery of a panoramic image from a set of partial views are suboptimal in the sense that the input images are aligned, or registe...
Bernardo Esteves Pires, Pedro M. Q. Aguiar
126
Voted
CGO
2003
IEEE
15 years 7 months ago
METRIC: Tracking Down Inefficiencies in the Memory Hierarchy via Binary Rewriting
In this paper, we present METRIC, an environment for determining memory inefficiencies by examining data traces. METRIC is designed to alter the performance behavior of applicatio...
Jaydeep Marathe, Frank Mueller, Tushar Mohan, Bron...
SCHEDULING
2008
112views more  SCHEDULING 2008»
15 years 3 months ago
Time-constrained project scheduling
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, ...
CC
2003
Springer
15 years 9 months ago
Improving Data Locality by Chunking
Cache memories were invented to decouple fast processors from slow memories. However, this decoupling is only partial, and many researchers have attempted to improve cache use by p...
Cédric Bastoul, Paul Feautrier
ICML
2002
IEEE
16 years 4 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton