1477 search results - page 77 / 296 » Complexity of (iterated) dominance |
139
click to vote
MCU
2007
15 years 8 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
240
click to vote
IWCIA
2009
Springer
16 years 1 months ago
2009
Springer
This work is settled in the framework of abstract simplicial complexes. We propose a definition of a watershed and of a collapse for maps defined on pseudomanifolds of arbitrary ...
188
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
159
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
183
click to vote
AIPS
2008
15 years 9 months ago
2008
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...