Sciweavers

2899 search results - page 407 / 580
» Dynamic Trees in Practice
Sort
View
ECOOP
2001
Springer
15 years 5 months ago
An Overview of AspectJ
AspectJ™ is a simple and practical aspect-oriented extension to Java™. With just a few new constructs, AspectJ provides support for modular implementation of a range of crosscu...
Gregor Kiczales, Erik Hilsdale, Jim Hugunin, Mik K...
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
15 years 5 months ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...
99
Voted
ECOOP
1998
Springer
15 years 4 months ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai
APSEC
1997
IEEE
15 years 4 months ago
A Test-case Generation Method for Concurrent Programs Including Task-types
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated taskinstances may not ...
Tetsuro Katayama, Zengo Furukawa, Kazuo Ushijima
118
Voted
SIGSOFT
1994
ACM
15 years 4 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...