Sciweavers

5473 search results - page 708 / 1095
» On the graph isomorphism problem
Sort
View
IROS
2008
IEEE
125views Robotics» more  IROS 2008»
16 years 1 months ago
Neighborhood denoising for learning high-dimensional grasping manifolds
— Human control of high degree-of-freedom robotic systems, e.g. anthropomorphic robot hands, is often difficult due to the overwhelming number of variables that need to be speci...
Aggeliki Tsoli, Odest Chadwicke Jenkins
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
16 years 28 days ago
A multi-objective approach for the prediction of loan defaults
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
Oluwarotimi Odeh, Praveen Koduru, Sanjoy Das, Alle...
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
16 years 10 days ago
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...
IWPEC
2004
Springer
16 years 4 days ago
Packing Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Luke Mathieson, Elena Prieto, Peter Shaw
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
15 years 11 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...