Sciweavers

4451 search results - page 150 / 891
» On Random Ordering Constraints
Sort
View
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 7 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
CP
2007
Springer
15 years 10 months ago
Boosting Probabilistic Choice Operators
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
Matthieu Petit, Arnaud Gotlieb
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
15 years 11 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
EOR
2006
90views more  EOR 2006»
15 years 4 months ago
A parallelizable dynamic fleet management model with random travel times
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
Huseyin Topaloglu
INFORMATICALT
2007
43views more  INFORMATICALT 2007»
15 years 4 months ago
Functional Test Generation Based on Combined Random and Deterministic Search Methods
Abstract. The aim of this paper is to explore some features of the functional test generation problem, and on the basis of the gained experience, to propose a practical method for ...
Eduardas Bareisa, Vacius Jusas, Kestutis Motiejuna...