Sciweavers

16404 search results - page 120 / 3281
» A set coverage problem
Sort
View
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
13 years 10 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
CEC
2010
IEEE
15 years 1 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
ICCBR
1995
Springer
15 years 6 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
105
Voted
PERCOM
2005
ACM
16 years 2 months ago
The Problem of Bluetooth Pollution and Accelerating Connectivity in Bluetooth Ad-Hoc Networks
This paper investigates a real-world problem termed "Bluetooth (BTH) pollution", which is expected to become commonplace as the mass deployment of BTH devices continues....
Somil Asthana, Dimitris N. Kalofonos
EWSN
2009
Springer
16 years 3 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...