Sciweavers

1406 search results - page 52 / 282
» Similarity in Programs
Sort
View
AI
1998
Springer
14 years 9 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque
93
Voted
IPMI
2007
Springer
15 years 10 months ago
Inter and Intra-modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 3 months ago
Automated re-invention of six patented optical lens systems using genetic programming
This paper describes how genetic programming was used as an invention machine to automatically synthesize complete designs for six optical lens systems that duplicated the functio...
John R. Koza, Sameer H. Al-Sakran, Lee W. Jones
WCRE
2003
IEEE
15 years 3 months ago
Analyzing Large Spreadsheet Programs
Although the results of spreadsheet programs are the base for very important decisions and are subject to many changes, they are only poorly documented. In this paper we introduce...
Markus Clermont
ICLP
2003
Springer
15 years 3 months ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia