Sciweavers

IWCMC
2009
ACM
13 years 9 months ago
Scheduling cooperative emergency response: or how the meek shall overcome the greedy
We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Mee...
Carol Dottin, Bilal Khan
CAIP
2003
Springer
161views Image Analysis» more  CAIP 2003»
13 years 9 months ago
Genetic Algorithm to Set Active Contour
Active contours, very popular in image segmentation, suffer from delicate adjustments of many parameters. We propose to carry out these adjustments using genetic algorithm. Here an...
Jean-Jacques Rousselle, Nicole Vincent, Nicolas Ve...
QSIC
2003
IEEE
13 years 9 months ago
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
Christine Cheng, Adrian Dumitrescu, Patrick J. Sch...
STACS
2005
Springer
13 years 9 months ago
Cycle Cover with Short Cycles
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
NPC
2005
Springer
13 years 9 months ago
A Greedy Algorithm for Capacity-Constrained Surrogate Placement in CDNs
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and con...
Yifeng Chen, Yanxiang He, Jiannong Cao, Jie Wu
CICLING
2005
Springer
13 years 9 months ago
Automatic Annotation of Corpora for Text Summarisation: A Comparative Study
This paper presents two methods which automatically produce annotated corpora for text summarisation on the basis of human abstracts. Both methods identify a set of sentences from ...
Constantin Orasan
AMOST
2005
ACM
13 years 10 months ago
Test prioritization for pairwise interaction coverage
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
KBSE
2005
IEEE
13 years 10 months ago
Constructing interaction test suites with greedy algorithms
Combinatorial approaches to testing are used in several fields, and have recently gained momentum in the field of software testing through software interaction testing. One-test...
Renée C. Bryce, Charles J. Colbourn
ICDCS
2006
IEEE
13 years 10 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
ROBOCUP
2007
Springer
106views Robotics» more  ROBOCUP 2007»
13 years 10 months ago
Beyond Frontier Exploration
This article investigates the prerequisites for a global exploration strategy in an unknown environment on a virtual disaster site. Assume that a robot equipped with a laser range...
Arnoud Visser, Xingrui-Ji, Merlijn van Ittersum, L...