Sciweavers

914 search results - page 33 / 183
» Analysis of Heuristic Synergies
Sort
View
TSMC
1998
90views more  TSMC 1998»
14 years 11 months ago
Redundancy problem in writing: from human to anthropomorphic robot arm
Abstract—This paper presents the analysis of motion of a redundant anthropomorphic arm during the writing. The modeling is based on the separation of the prescribed movement into...
Veljko Potkonjak, Mirjana Popovic, Mihailo Lazarev...
IJACTAICIT
2010
155views more  IJACTAICIT 2010»
14 years 9 months ago
Constructive Dynamic Program Slicing Research
Program slicing is a promising technique for providing automated support for various important software engineering activities. There exists hundreds of scientific studies on the ...
Jaakko Korpi, Jussi Koskinen
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 1 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
ISSTA
2009
ACM
15 years 6 months ago
Advanced code coverage analysis using substring holes
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...
Yoram Adler, Eitan Farchi, Moshe Klausner, Dan Pel...
NJC
1998
86views more  NJC 1998»
14 years 11 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen