Sciweavers

418 search results - page 42 / 84
» Searching for events in the blogosphere
Sort
View
JTRES
2010
ACM
13 years 8 months ago
Exhaustive testing of safety critical Java
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Pat...
Tomás Kalibera, Pavel Parizek, Michal Maloh...
GIS
2005
ACM
14 years 8 months ago
Adaptive nearest neighbor queries in travel time networks
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
Wei-Shinn Ku, Roger Zimmermann, Haojun Wang, Chi-N...
GMP
2006
IEEE
161views Solid Modeling» more  GMP 2006»
14 years 1 months ago
Tracking Point-Curve Critical Distances
This paper presents a novel approach to continuously and robustly tracking critical (geometrically, perpendicular and/or extremal) distances from a moving plane point p ∈ R2 to a...
Xianming Chen, Elaine Cohen, Richard F. Riesenfeld
COR
2010
123views more  COR 2010»
13 years 7 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young