Sciweavers

9842 search results - page 1375 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
IPPS
2009
IEEE
16 years 1 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
ADBIS
2009
Springer
143views Database» more  ADBIS 2009»
16 years 1 months ago
Cost-Based Vectorization of Instance-Based Integration Processes
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
Matthias Böhm, Dirk Habich, Steffen Preissler...
ATAL
2009
Springer
16 years 1 months ago
Stigmergic reasoning over hierarchical task networks
Stigmergy is usually associated with semantically simple problems such as routing. It can be applied to more complex problems by encoding them in the environment through which sti...
H. Van Dyke Parunak, Theodore C. Belding, Robert B...
COSIT
2009
Springer
119views GIS» more  COSIT 2009»
16 years 1 months ago
Grounding Geographic Categories in the Meaningful Environment
Abstract. Ontologies are a common approach to improve semantic interoperability by explicitly specifying the vocabulary used by a particular information community. Complex expressi...
Simon Scheider, Krzysztof Janowicz, Werner Kuhn
« Prev « First page 1375 / 1969 Last » Next »