1604 search results - page 134 / 321 » Regularization on Discrete Spaces |
116
Voted
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— What would it be like if we could give our robot high level commands and it would automatically execute them in a verifiably correct fashion in dynamically changing environmen...
132
click to vote
NIPS
2007
15 years 5 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
152
Voted
TON
2008
15 years 3 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
132
click to vote
LSSC
2007
Springer
15 years 10 months ago
2007
Springer
A successive refinement of a finite element grid provides a sequence of nested grids and hierarchy of nested finite element spaces as well as a natural hierarchical decompositio...
133
Voted
NIPS
2004
15 years 5 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...