Sciweavers

1923 search results - page 93 / 385
» Weighted Decision Trees
Sort
View
AROBOTS
2006
97views more  AROBOTS 2006»
15 years 6 months ago
How a mobile robot selects landmarks to make a decision based on an information criterion
Most current mobile robots are designed to determine their actions according to their positions. Before making a decision, they need to localize themselves. Thus, their observation...
Noriaki Mitsunaga, Minoru Asada
IJNSEC
2008
78views more  IJNSEC 2008»
15 years 6 months ago
Fault Tolerant Weighted Voting Algorithms
Agreement algorithms can be categorized in different ways. One categorization of such algorithms is based on whether the final decisions are exact or inexact. In inexact algorithm...
Azad H. Azadmanesh, Alireza Farahani, Lotfi Najjar
ICCD
2002
IEEE
93views Hardware» more  ICCD 2002»
16 years 3 months ago
Speculative Trace Scheduling in VLIW Processors
VLIW processors are statically scheduled processors and their performance depends on the quality of the compiler’s scheduler. We propose a scheduling scheme where the applicatio...
Manvi Agarwal, S. K. Nandy, Jos T. J. van Eijndhov...
DAC
2008
ACM
16 years 7 months ago
DeFer: deferred decision making enabled fixed-outline floorplanner
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
Jackey Z. Yan, Chris Chu
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
15 years 10 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang