Sciweavers

206 search results - page 35 / 42
» Simplifying failure-inducing input
Sort
View
WCFLP
2005
ACM
14 years 1 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
CIS
2005
Springer
14 years 1 months ago
Distance Protection of Compensated Transmission Line Using Computational Intelligence
A new approach for protection of transmission line including TCSC is presented in this paper. The proposed method includes application of Fuzzy Neural Network for distance relaying...
S. R. Samantaray, Pradipta K. Dash, Ganapati Panda...
MFCS
2005
Springer
14 years 1 months ago
Combining Self-reducibility and Partial Information Algorithms
A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, ...
André Hernich, Arfst Nickelsen
PCM
2005
Springer
157views Multimedia» more  PCM 2005»
14 years 1 months ago
Segmentation of the Liver Using the Deformable Contour Method on CT Images
Abstract. Automatic liver segmentation from abdominal computed tomography (CT) images is one of the most important steps for computeraided diagnosis (CAD) for liver CT. However, th...
Seong-Jae Lim, Yong-Yeon Jeong, Yo-Sung Ho
AMAI
2004
Springer
14 years 1 months ago
Improving Exact Algorithms for MAX-2-SAT
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
Haiou Shen, Hantao Zhang