Sciweavers

535 search results - page 40 / 107
» Insertion and Expansion Operations for
Sort
View
ACTA
2010
191views more  ACTA 2010»
14 years 12 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
ACTA
2005
87views more  ACTA 2005»
14 years 11 months ago
Hybrid networks of evolutionary processors are computationally complete
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...
Erzsébet Csuhaj-Varjú, Carlos Mart&i...
TC
2010
14 years 10 months ago
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su
ICCTA
2007
IEEE
15 years 6 months ago
Partially Dynamic Concurrent Update of Distributed Shortest Paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele ...
IPPS
2000
IEEE
15 years 4 months ago
Register Assignment for Software Pipelining with Partitioned Register Banks
Many techniques for increasing the amount of instruction-level parallelism (ILP) put increased pressure on the registers inside a CPU. These techniques allow for more operations t...
Jason Hiser, Steve Carr, Philip H. Sweany, Steven ...