Sciweavers

439 search results - page 50 / 88
» Choiceless Computation and Symmetry
Sort
View
GD
2003
Springer
15 years 3 months ago
The Puzzle Layout Problem
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda
CCR
2010
132views more  CCR 2010»
14 years 7 months ago
Scafida: a scale-free network inspired data center architecture
Data centers have a crucial role in current Internet architecture supporting content-centric networking. State-of-theart data centers have different architectures like fat-tree [1...
László Gyarmati, Tuan Anh Trinh
JNS
2008
63views more  JNS 2008»
14 years 9 months ago
Numerical Continuation of Hamiltonian Relative Periodic Orbits
The bifurcation theory and numerics of periodic orbits of general dynamical systems is well developed, and in recent years there has been rapid progress in the development of a bi...
Claudia Wulff, Andreas Schebesch
SPIN
2005
Springer
15 years 3 months ago
An Incremental Heap Canonicalization Algorithm
Abstract. The most expensive operation in explicit state model checking is the hash computation required to store the explored states in a hash table. One way to reduce this comput...
Madanlal Musuvathi, David L. Dill
CORR
2006
Springer
98views Education» more  CORR 2006»
14 years 9 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters