Sciweavers

419 search results - page 33 / 84
» Constraint models for graceful graphs
Sort
View
COR
2008
142views more  COR 2008»
14 years 12 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
AAAI
2010
15 years 1 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
AIRS
2006
Springer
15 years 4 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
DAGSTUHL
2004
15 years 1 months ago
Multi-Domain Integration with MOF and extended Triple Graph Grammars
One aim of tool integration is designing an integrated development environment that accesses the data/models of different tools and keeps them consistent throughout a project bein...
Alexander Königs, Andy Schürr
79
Voted
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
15 years 9 months ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong