2080 search results - page 153 / 416 » Measuring empirical computational complexity |
101
click to vote
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
—A principal challenge in modern computational finance is efficient portfolio design – portfolio optimization followed by decision-making. Optimization based on even the widely...
165
click to vote
JAIR
2008
15 years 4 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
133
click to vote
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An O(n2 m lg m) time algorithm is presented for computing the maximum ...
125
click to vote
ESANN
1998
15 years 5 months ago
1998
Our problem concerns the joint interpretation of UltraSonic and InfraRed measurements provided by a composite proximity sensor, in order to extract geometrical and morphological f...
167
Voted
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...