4860 search results - page 471 / 972 » SNPs Problems, Complexity, and Algorithms |
176
click to vote
LPAR
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
130
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
124
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
147
click to vote
INFOCOM
1995
IEEE
15 years 7 months ago
1995
IEEE
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
117
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...