Sciweavers

601 search results - page 109 / 121
» Playing large games using simple strategies
Sort
View
PPSN
2004
Springer
15 years 11 months ago
Multi-cellular Development: Is There Scalability and Robustness to Gain?
Evolving large phenotypes remains nowadays a problem due to the combinatorial explosion of the search space. Seeking better scalability and inspired by the development of biologica...
Daniel Roggen, Diego Federici
INFOCOM
2003
IEEE
15 years 11 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid
ECCV
2010
Springer
15 years 11 months ago
TriangleFlow: Optical Flow with Triangulation-based Higher-Order Likelihoods
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...
SNPD
2007
15 years 7 months ago
Biswapped Networks and Their Topological Properties
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
Wenjun Xiao, Weidong Chen, Mingxin He, Wenhong Wei...
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
15 years 6 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle