1923 search results - page 288 / 385 » Weighted Decision Trees |
182
click to vote
TLCA
2007
Springer
16 years 14 days ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
132
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
144
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
190
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
166
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...