Sciweavers

3885 search results - page 684 / 777
» Clarifying Goal Models
Sort
View
IJFCS
2006
106views more  IJFCS 2006»
15 years 6 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...
CORR
2007
Springer
92views Education» more  CORR 2007»
15 years 6 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
ECCC
2007
124views more  ECCC 2007»
15 years 6 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler
SIGIR
2008
ACM
15 years 6 months ago
Task-aware search personalization
Search personalization has been pursued in many ways, in order to provide better result rankings and better overall search experience to individual users [5]. However, blindly app...
Julia Luxenburger, Shady Elbassuoni, Gerhard Weiku...
IJCSA
2007
130views more  IJCSA 2007»
15 years 6 months ago
Purposeful Deployment via Self-Organizing Flocking Coalition in Sensor Networks
This paper presents a deployment strategy via self organizing flocking coalitions for mobile sensor network coverage. The concepts of our approach are inspired by the flocking phe...
Yee Ming Chen, Shu-Hao Chang