Sciweavers

1036 search results - page 24 / 208
» The case for a location metasystem
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 7 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
GEOINFORMATICA
2006
102views more  GEOINFORMATICA 2006»
13 years 7 months ago
Mining Co-Location Patterns with Rare Events from Spatial Data Sets
Abstract A co-location pattern is a group of spatial features/events that are frequently co-located in the same region. For example, human cases of West Nile Virus often occur in r...
Yan Huang, Jian Pei, Hui Xiong
ICSM
2002
IEEE
14 years 18 days ago
A Case Study of Unanticipated Incremental Change
Incremental changes add new functionality and properties to software. They are the core of software evolution, maintenance, iterative development, agile development, and similar s...
Václav Rajlich, Prashant Gosavi
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 8 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 11 months ago
Percolation in the Secrecy Graph
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
Amites Sarkar, Martin Haenggi