Sciweavers

419 search results - page 25 / 84
» First Order Paths in Ordered Trees
Sort
View
ISMVL
2003
IEEE
85views Hardware» more  ISMVL 2003»
14 years 3 months ago
On the Average Path Length in Decision Diagrams of Multiple-Valued Functions
We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate t...
Jon T. Butler, Tsutomu Sasao
RAS
1998
145views more  RAS 1998»
13 years 9 months ago
Coordinated path planning for multiple robots
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
Petr Svestka, Mark H. Overmars
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 11 months ago
Frugality in path auctions
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
Edith Elkind, Amit Sahai, Kenneth Steiglitz
CHES
2006
Springer
146views Cryptology» more  CHES 2006»
14 years 1 months ago
Path Swapping Method to Improve DPA Resistance of Quasi Delay Insensitive Asynchronous Circuits
This paper presents a Path Swapping (PS) method which enables to enhance the security of Quasi Delay Insensitive Asynchronous Circuits against Power Analysis (PA) attack. This appr...
G. Fraidy Bouesse, Gilles Sicard, Marc Renaudin
AAAI
2007
14 years 5 days ago
Learning Graphical Model Structure Using L1-Regularization Paths
Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the ...
Mark W. Schmidt, Alexandru Niculescu-Mizil, Kevin ...