2000 search results - page 211 / 400 » Program Transformation and Proof Transformation |
107
click to vote
AIPS
1996
15 years 5 months ago
1996
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...
110
click to vote
ENTCS
2006
15 years 4 months ago
2006
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
151
click to vote
JSW
2008
15 years 4 months ago
2008
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...
127
click to vote
JCB
2007
15 years 4 months ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
107
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...