Sciweavers

458 search results - page 45 / 92
» Totally magic graphs
Sort
View
ECSQARU
2009
Springer
14 years 2 months ago
Triangulation Heuristics for BN2O Networks
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...
Petr Savický, Jirí Vomlel
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
14 years 1 months ago
An Iterative Algorithm for Battery-Aware Task Scheduling on Portable Computing Platforms
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
Jawad Khan, Ranga Vemuri
HCW
1999
IEEE
13 years 12 months ago
Multiple Cost Optimization for Task Assignment in Heterogeneous Computing Systems Using Learning Automata
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...
Raju D. Venkataramana, N. Ranganathan
KDD
2010
ACM
327views Data Mining» more  KDD 2010»
13 years 11 months ago
Cold start link prediction
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
Vincent Leroy, Berkant Barla Cambazoglu, Francesco...
SIROCCO
2007
13 years 9 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...