5592 search results - page 62 / 1119 » On Random Betweenness Constraints |
WEA
2010
Springer
14 years 3 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
INFOCOM
2012
IEEE
12 years 12 days ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
FS
2006
13 years 10 months ago
2006
We prove existence of stochastic financial equilibria on filtered spaces more general than the ones generated by finite-dimensional Brownian motions. These equilibria span complete...
CAEPIA
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
FLAIRS
2008
14 years 8 days ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...