Sciweavers

230 search results - page 34 / 46
» A Linear Time Algorithm for L(2, 1)-Labeling of Trees
Sort
View
IJFCS
2007
93views more  IJFCS 2007»
13 years 9 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
14 years 1 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
14 years 22 days ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
COLOGNETWENTE
2009
13 years 10 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
IPPS
2002
IEEE
14 years 1 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna