Sciweavers

1941 search results - page 23 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
WWW
2004
ACM
14 years 8 months ago
Metacrystal: visualizing the degree of overlap between different search engines
MetaCrystal enables users to visualize and control the degree of overlap between the results returned by different search engines. Several linked overview tools support rapid expl...
Anselm Spoerri
DM
2002
95views more  DM 2002»
13 years 7 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...
SPAA
2006
ACM
14 years 1 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
ICCAD
1996
IEEE
80views Hardware» more  ICCAD 1996»
13 years 11 months ago
Generalized constraint generation in the presence of non-deterministic parasitics
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
Edoardo Charbon, Paolo Miliozzi, Enrico Malavasi, ...
AI
2006
Springer
13 years 11 months ago
Partial Local FriendQ Multiagent Learning: Application to Team Automobile Coordination Problem
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
Julien Laumonier, Brahim Chaib-draa