Sciweavers

1984 search results - page 114 / 397
» The colourful feasibility problem
Sort
View
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
15 years 7 months ago
Making data structures confluently persistent
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
Amos Fiat, Haim Kaplan
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
15 years 7 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...
111
Voted
MJ
2008
72views more  MJ 2008»
15 years 5 months ago
Cell architecture for nanoelectronic design
Several nanoelectronic devices have been already proved. However, no architecture which makes use of them provides a feasible opportunity to build medium/large systems. Nanoarchit...
Ferran Martorell, Antonio Rubio
EOR
2007
111views more  EOR 2007»
15 years 5 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
IJRR
2010
107views more  IJRR 2010»
15 years 4 months ago
Non-parametric Learning to Aid Path Planning over Slopes
— This paper addresses the problem of closing the loop from perception to action selection for unmanned ground vehicles, with a focus on navigating slopes. A new non-parametric l...
Sisir Karumanchi, Thomas Allen, Tim Bailey, Steve ...