Sciweavers

5180 search results - page 62 / 1036
» Concurrency, Time, and Constraints
Sort
View
AAAI
2010
15 years 1 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek
MST
2010
93views more  MST 2010»
14 years 10 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
NETCOOP
2009
Springer
15 years 6 months ago
Optimal File Splitting for Wireless Networks with Concurrent Access
The fundamental limits on channel capacity form a barrier to the sustained growth on the use of wireless networks. To cope with this, multi-path communication solutions provide a p...
Gerard Hoekstra, Rob van der Mei, Yoni Nazarathy, ...
GIS
2010
ACM
14 years 9 months ago
Time geography inverted: recognizing intentions in space and time
Mobile intention recognition is the problem of inferring a mobile user's intentions from her behavior in geographic space. Such behavior is constrained in space and time. Cur...
Peter Kiefer, Martin Raubal, Christoph Schlieder
CHES
2004
Springer
170views Cryptology» more  CHES 2004»
15 years 5 months ago
Concurrent Error Detection Schemes for Involution Ciphers
Because of the rapidly shrinking dimensions in VLSI, transient and permanent faults arise and will continue to occur in the near future in increasing numbers. Since cryptographic c...
Nikhil Joshi, Kaijie Wu, Ramesh Karri