Sciweavers

3267 search results - page 525 / 654
» Generalized quasirandom graphs
Sort
View
ICFP
2005
ACM
16 years 6 months ago
The anatomy of a loop: a story of scope and control
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
Olin Shivers
MOBISYS
2006
ACM
16 years 6 months ago
Building realistic mobility models from coarse-grained traces
In this paper we present a trace-driven framework capable of building realistic mobility models for the simulation studies of mobile systems. With the goal of realism, this framew...
Jungkeun Yoon, Brian D. Noble, Mingyan Liu, Minkyo...
MOBIHOC
2005
ACM
16 years 6 months ago
Hybrid sensor networks: a small world
In this paper, we investigate the use of limited infrastructure, in the form of wires, for improving the energy efficiency of a wireless sensor network. We call such a sensor netw...
Gaurav Sharma, Ravi Mazumdar
ICCAD
2007
IEEE
107views Hardware» more  ICCAD 2007»
16 years 3 months ago
Computation of minimal counterexamples by using black box techniques and symbolic methods
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
Tobias Nopper, Christoph Scholl, Bernd Becker
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
16 years 3 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou