4930 search results - page 772 / 986 » Learning minimal abstractions |
223
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
205
click to vote
ECBS
2010
IEEE
15 years 8 months ago
2010
IEEE
—One of the ideas of agile software development is to respond to changes rather than following a plan. Constantly changing businesses result in changing requirements, to be handl...
179
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Abstract--In this paper, the problem of bus driven floorplanning is addressed. Given a set of modules and bus specifications, a floorplan solution including the bus routes will be ...
208
click to vote
CANS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Wireless sensors are low power devices which are highly constrained in terms of computational capabilities, memory, and communication bandwidth. While battery life is the...
206
click to vote
BIRTHDAY
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce an ambient-based calculus that combines ambient mobility with process mobility, uses group names to collect ambients with homologous features, and exploits c...