Sciweavers

9842 search results - page 1786 / 1969
» Problem complexity
Sort
View
135
Voted
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 6 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
112
Voted
IEEEINTERACT
2002
IEEE
15 years 6 months ago
Code Cache Management Schemes for Dynamic Optimizers
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
Kim M. Hazelwood, Michael D. Smith
117
Voted
ISCA
2002
IEEE
91views Hardware» more  ISCA 2002»
15 years 6 months ago
Slack: Maximizing Performance Under Technological Constraints
Many emerging processor microarchitectures seek to manage technological constraints (e.g., wire delay, power, and circuit complexity) by resorting to nonuniform designs that provi...
Brian A. Fields, Rastislav Bodík, Mark D. H...
123
Voted
HOTSWUP
2009
ACM
15 years 5 months ago
Automating Database Schema Evolution in Information System Upgrades
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
112
Voted
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 5 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
« Prev « First page 1786 / 1969 Last » Next »