Sciweavers

923 search results - page 23 / 185
» The Computational Structure of Progress Conditions
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
14 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
IPPS
1998
IEEE
15 years 1 months ago
Network-Aware Distributed Computing: A Case Study
Abstract. The development of network-aware applications, i.e. applications that dynamically adapt to network conditions, has had some success in the domain of multimedia applicatio...
Hongsuda Tangmunarunkit, Peter Steenkiste
IEEEPACT
2009
IEEE
14 years 7 months ago
Core-Selectability in Chip Multiprocessors
Abstract--The centralized structures necessary for the extraction of instruction-level parallelism (ILP) are consuming progressively smaller portions of the total die area of chip ...
Hashem Hashemi Najaf-abadi, Niket Kumar Choudhary,...
45
Voted
ISCAS
2006
IEEE
65views Hardware» more  ISCAS 2006»
15 years 3 months ago
Symbolic analysis of bifurcations in planar variable structure systems
— In this paper a methodology to the analysis of bifurcations of variable structure systems is proposed. This methodology, based on the use of symbolic computation packages, is d...
Ubirajara F. Moreno, Eugênio B. Castelan, Ed...
BROADNETS
2004
IEEE
15 years 1 months ago
Structures for In-Network Moving Object Tracking in Wireless Sensor Networks
One important application of wireless sensor networks is tracking moving objects. The recent progress has made it possible for tiny sensors to have more computing power and storag...
Chih-Yu Lin, Yu-Chee Tseng