4930 search results - page 362 / 986 » Learning minimal abstractions |
159
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract--A class of distortions termed functional Bregman divergences is defined, which includes squared error and relative entropy. A functional Bregman divergence acts on functi...
117
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
182
click to vote
AICOM
2004
15 years 6 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
146
click to vote
JAMDS
2002
15 years 6 months ago
2002
Abstract. An efficient optimum solution is presented for a real-life employee daysoff scheduling problem with a three-week cycle. Over a given work cycle, each worker is given 14 s...
185
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--We propose an algorithm to maximize the instantaneous sum data rate transmitted by a base station in the downlink of a multiuser multiple-input, multiple-output system. T...