Sciweavers

8780 search results - page 308 / 1756
» On the Feasibility of Consistent Computations
Sort
View
175
Voted
ENDM
2010
100views more  ENDM 2010»
15 years 7 months ago
Large-scale multi-period precedence constrained knapsack problem: A mining application
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycool...
157
Voted
RAS
2006
92views more  RAS 2006»
15 years 7 months ago
Trajectory generation and control for four wheeled omnidirectional vehicles
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...
Oliver Purwin, Raffaello D'Andrea
OL
2010
185views more  OL 2010»
15 years 5 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
214
Voted
SARA
2009
Springer
16 years 1 days ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne
192
Voted
FPL
2000
Springer
143views Hardware» more  FPL 2000»
15 years 11 months ago
Memory Access Schemes for Configurable Processors
Abstract. This work discusses the Memory Architecture for Reconfigurable Computers (MARC), a scalable, device-independent memory interface that supports both irregular (via configu...
Holger Lange, Andreas Koch