143 search results - page 3 / 29 » A Fast Incremental Hypervolume Algorithm |
113
click to vote
ACL
2007
15 years 1 months ago
2007
This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structur...
ASPDAC
2005
ACM
15 years 1 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
AIPS
2004
15 years 1 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
119
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
101
Voted
SMA
1995
ACM
15 years 3 months ago
1995
ACM
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...