1955 search results - page 62 / 391 » Can Computers Handle Adverbs |
123
click to vote
PPSN
1998
Springer
15 years 8 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
148
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
140
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
Abstract - We propose a new algorithm for the performancedriven interconnect design problem, based on alphabetic trees. The interconnect topology is determined in a global manner a...
100
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We study the learning models defined in [AKST97]: Learning with equivalence and limited membership queries and learning with equivalence and malicious membership queries. We show ...
131
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...