1092 search results - page 100 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
165
click to vote
ICML
2006
IEEE
16 years 6 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
149
click to vote
FM
2009
Springer
16 years 19 days ago
2009
Springer
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
142
click to vote
GECCO
2007
Springer
16 years 6 days ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
161
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
158
Voted
MP
2008
15 years 6 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...