Sciweavers

7991 search results - page 515 / 1599
» Using More Reasoning to Improve
Sort
View
ICSE
1998
IEEE-ACM
15 years 11 months ago
Reuse-Driven Interprocedural Slicing
Program slicing, a technique to compute the subset of program statements that can affect the value of a program variable at a specific program point, is widely used in tools to su...
Mary Jean Harrold, Ning Ci
AIPS
2006
15 years 8 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
JSS
2008
113views more  JSS 2008»
15 years 6 months ago
A model for software rework reduction through a combination of anomaly metrics
Analysis of anomalies reported during testing of a project can tell a lot about how well the processes and products work. Still, organizations rarely use anomaly reports for more t...
Lars-Ola Damm, Lars Lundberg, Claes Wohlin
CP
2010
Springer
15 years 5 months ago
Heuristics for Planning with SAT
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Jussi Rintanen
ESANN
2007
15 years 8 months ago
Toward a robust 2D spatio-temporal self-organization
Abstract. Several models have been proposed for spatio-temporal selforganization, among which the TOM model by Wiemer [1] is particularly promising. In this paper, we propose to ad...
Thomas Girod, Laurent Bougrain, Frédé...