Sciweavers

1477 search results - page 141 / 296
» Complexity of (iterated) dominance
Sort
View
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
16 years 3 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
CP
2004
Springer
15 years 12 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
SIGECOM
2003
ACM
97views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
A robust open ascending-price multi-unit auction protocol against false-name bids
This paper presents a new ascending-price multi-unit auction protocol. As far as the authors are aware, this is the first protocol that has an open format, and in which sincere b...
Atsushi Iwasaki, Makoto Yokoo, Kenji Terada
ICALP
2003
Springer
15 years 11 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren
NIPS
2001
15 years 7 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning