Sciweavers

389 search results - page 33 / 78
» Some natural decision problems in automatic graphs
Sort
View
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
14 years 19 days ago
System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs
Initial results have been achieved for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first discusses the ne...
Zhun Fan, Kisung Seo, Jianjun Hu, Ronald C. Rosenb...
HPCC
2011
Springer
12 years 7 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 7 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
FSS
2007
113views more  FSS 2007»
13 years 7 months ago
The core of bicapacities and bipolar games
Bicooperative games generalize classical cooperative games in the sense that a player is allowed to play in favor or against some aim, besides non participation. Bicapacities are ...
Lijue Xie, Michel Grabisch
INFOCOM
1997
IEEE
13 years 11 months ago
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms
We investigate the problem of routing connections with QoS requirements across one or more networks, when the information available for making routing decisions is inaccurate and ...
Roch Guérin, Ariel Orda