Sciweavers

363 search results - page 31 / 73
» Experimental Evaluations of Algorithms for IP Table Minimiza...
Sort
View
PARELEC
2002
IEEE
14 years 20 days ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
ICML
2004
IEEE
14 years 8 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
BICOB
2009
Springer
14 years 2 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
14 years 4 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson
NIPS
2007
13 years 9 months ago
Selecting Observations against Adversarial Objectives
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
Andreas Krause, H. Brendan McMahan, Carlos Guestri...