Sciweavers

824 search results - page 128 / 165
» Constructing Functional Programs for Grammar Analysis Proble...
Sort
View
JGO
2010
100views more  JGO 2010»
14 years 8 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 8 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
AGENTS
2000
Springer
15 years 6 months ago
Ant-like missionaries and cannibals: synthetic pheromones for distributed motion control
Many applied problems in domains such as military operations, manufacturing, and logistics require that entities change location under certain constraints. These problems are trad...
H. Van Dyke Parunak, Sven Brueckner
POPL
2010
ACM
15 years 11 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel

Publication
139views
15 years 1 months ago
Separation of concerns in compiler development using aspect-orientation
A major difficulty in compiler development regards the proper modularization of concerns among the various compiler phases. The traditional object-oriented development paradigm ha...