Sciweavers

6300 search results - page 241 / 1260
» We have it easy, but do we have it right
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
101
Voted
SCL
2008
130views more  SCL 2008»
15 years 1 months ago
Exponential stability of impulsive systems with application to uncertain sampled-data systems
We establish exponential stability of nonlinear time-varying impulsive systems by employing Lyapunov functions with discontinuity at the impulse times. Our stability conditions ha...
Payam Naghshtabrizi, João P. Hespanha, Andr...
107
Voted
AI
2004
Springer
15 years 1 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne
CC
2002
Springer
131views System Software» more  CC 2002»
15 years 1 months ago
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
Abstract. This paper describes the C Intermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C ...
George C. Necula, Scott McPeak, Shree Prakash Rahu...
OSN
2007
185views more  OSN 2007»
15 years 1 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane