491 search results - page 88 / 99 » On cyclically orientable graphs |
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
SIGMOD
2011
ACM
12 years 9 months ago
2011
ACM
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
GD
2006
Springer
13 years 10 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
GECCO
2008
Springer
2008
Springer
Bond-graphs + genetic programming: analysis of an automatically synthesized rotary mechanical system
13 years 7 months ago
Initial results of an experiment devised to combine Bond-Graph modeling and simulation with genetic programming for automated design of a simple mechatronic system are reported in...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...