Sciweavers

837 search results - page 150 / 168
» Hard combinators
Sort
View
EMSOFT
2008
Springer
14 years 12 months ago
Automatically transforming and relating Uppaal models of embedded systems
Relations between models are important for effective automatic validation, for comparing implementations with specifications, and for increased understanding of embedded systems d...
Timothy Bourke, Arcot Sowmya
IMC
2007
ACM
14 years 11 months ago
Understanding wifi-based connectivity from moving vehicles
– Using measurements from VanLAN, a modest-size testbed that we have deployed, we analyze the fundamental characteristics of WiFi-based connectivity between basestations and vehi...
Ratul Mahajan, John Zahorjan, Brian Zill
97
Voted
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
14 years 11 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
WICON
2008
14 years 11 months ago
Towards distributed network classification for mobile ad hoc networks
Mobile ad hoc networks range from traditional MANETs where end-to-end paths exist from sources to destinations, to DTNs where no contemporaneous end-to-end paths exist and communi...
Dimitrios Antonellis, Ahmed Mansy, Konstantinos Ps...
TREC
2004
14 years 11 months ago
Can We Get A Better Retrieval Function From Machine?
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
Weiguo Fan, Wensi Xi, Edward A. Fox, Li Wang