7522 search results - page 78 / 1505 » Spacing memetic algorithms |
85
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
77
Voted
STOC
2003
ACM
16 years 25 days ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
105
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult ...
113
click to vote
AAAI
1998
15 years 1 months ago
1998
Reinforcement learning is an effective technique for learning action policies in discrete stochastic environments, but its efficiency can decay exponentially with the size of the ...
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...