1033 search results - page 130 / 207 » The Relative History Heuristic |
166
click to vote
MMB
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
146
click to vote
PKC
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
168
Voted
JBI
2004
15 years 6 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
167
Voted
CONSTRAINTS
2010
15 years 4 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
158
click to vote
GIS
2010
ACM
15 years 3 months ago
2010
ACM
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...