Sciweavers

1494 search results - page 86 / 299
» Less Extreme Programming
Sort
View
110
Voted
EVOW
2005
Springer
15 years 8 months ago
Evolving Reversible Circuits for the Even-Parity Problem
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in ord...
Mihai Oltean
97
Voted
LPAR
2005
Springer
15 years 8 months ago
Integration of a Software Model Checker into Isabelle
Abstract. The paper presents a combination of interactive and automatic tools in the area of software verification. We have integrated a newly developed software model checker int...
Matthias Daum, Stefan Maus, Norbert Schirmer, M. N...
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 2 months ago
Twenty-Five Moves Suffice for Rubik's Cube
How many moves does it take to solve Rubik's Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or mor...
Tomas Rokicki
CP
2003
Springer
15 years 7 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
120
Voted
AMAST
2010
Springer
14 years 9 months ago
Type Fusion
Fusion is an indispensable tool in the arsenal of techniques for program derivation. Less well-known, but equally valuable is type fusion, which states conditions for fusing an app...
Ralf Hinze