Sciweavers

15485 search results - page 141 / 3097
» Computing Optimal Subsets
Sort
View
94
Voted
SOSP
1997
ACM
15 years 3 months ago
Automated Hoarding for Mobile Computers
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
Geoffrey H. Kuenning, Gerald J. Popek
RECOMB
2010
Springer
15 years 29 days ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...
COSIT
2001
Springer
186views GIS» more  COSIT 2001»
15 years 7 months ago
Computational Structure in Three-Valued Nearness Relations
The development of cognitively plausible models of human spatial reasoning may ultimately result in computational systems that are better equipped to meet human needs. This paper e...
Matt Duckham, Michael F. Worboys
FSTTCS
2001
Springer
15 years 7 months ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...
104
Voted
AIPS
1994
15 years 3 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald