526 search results - page 18 / 106 » On the Number of Minimal Addition Chains |
ISOLA
2010
Springer
14 years 8 months ago
2010
Springer
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
135
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
Computational comparison is made between two feature selection approaches for nding a separating plane that discriminates between two point sets in an n-dimensional feature space ...
SENSYS
2003
ACM
15 years 2 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...