Sciweavers

3838 search results - page 293 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
GBRPR
2005
Springer
15 years 11 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
185
Voted
TSE
2010
136views more  TSE 2010»
15 years 4 months ago
A Theoretical and Empirical Study of Search-Based Testing: Local, Global, and Hybrid Search
Search based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. How...
Mark Harman, Phil McMinn
WCE
2007
15 years 7 months ago
An age artificial immune system for order pickings in an AS/RS with multiple I/O stations
— This paper proposes an age artificial immune system (AAIS), for optimal order pickings in an Automated Storage and Retrieval System (AS/RS) with multiple input/ output stations...
K. L. Mak, Peggy S. K. Lau
166
Voted
AAAI
1996
15 years 7 months ago
Monitoring the Progress of Anytime Problem-Solving
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
Eric A. Hansen, Shlomo Zilberstein
FOCS
2004
IEEE
15 years 10 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...