Sciweavers

399 search results - page 67 / 80
» Efficient Model Checking Using Tabled Resolution
Sort
View
CAV
2006
Springer
116views Hardware» more  CAV 2006»
14 years 10 days ago
Lazy Shape Analysis
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...
DAC
2002
ACM
14 years 9 months ago
A flexible accelerator for layer 7 networking applications
In this paper, we present a flexible accelerator designed for networking applications. The accelerator can be utilized efficiently by a variety of Network Processor designs. Most ...
Gokhan Memik, William H. Mangione-Smith
IAJIT
2007
146views more  IAJIT 2007»
13 years 8 months ago
Adaptive Optimizing of Hello Messages in Wireless Ad-Hoc Networks
: Routing is an important functional aspect in wireless ad-hoc networks that handles discovering and maintaining the paths between nodes within a network. Due to nodes mobility, th...
Essam Natsheh, Adznan B. Jantan, Sabira Khatun, Su...
KAIS
2000
131views more  KAIS 2000»
13 years 8 months ago
Intentions in the Coordinated Generation of Graphics and Text from Tabular Data
To use graphics efficiently in an automatic report generation system, one has to model messages and how they go from the writer (intention) to the reader (interpretation). This pap...
Massimo Fasciano, Guy Lapalme
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg