Sciweavers

478 search results - page 43 / 96
» Some Existence and Preservation Results for Optimal Fixpoint...
Sort
View
LPAR
2005
Springer
14 years 4 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang
ICCV
2011
IEEE
12 years 10 months ago
Parsing Video Events with Goal inference and Intent Prediction
In this paper, we present an event parsing algorithm based on Stochastic Context Sensitive Grammar (SCSG) for understanding events, inferring the goal of agents, and predicting th...
Mingtao Pei, School of Computer Science, Yunde Jia...
GECCO
2004
Springer
14 years 4 months ago
How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution
The use of Genetic Algorithms in evolution of mutants and test cases offers new possibilities in addressing some of the main problems of mutation testing. Most specifically the p...
Konstantinos Adamopoulos, Mark Harman, Robert M. H...
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 10 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
SLIP
2005
ACM
14 years 4 months ago
Congestion prediction in early stages
Routability optimization has become a major concern in the physical design cycle of VLSI circuits. Due to the recent advances in VLSI technology, interconnect has become a dominan...
Chiu-Wing Sham, Evangeline F. Y. Young