5138 search results - page 346 / 1028 » Randomized Algorithms for 3-SAT |
157
click to vote
ICALP
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
155
click to vote
WEA
2004
Springer
16 years 10 hour ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
179
click to vote
BIRTHDAY
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
171
click to vote
EMO
2001
Springer
15 years 11 months ago
2001
Springer
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
197
click to vote
EWCBR
2006
Springer
15 years 10 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...