3750 search results - page 448 / 750 » Timed Automata Patterns |
104
Voted
TCAD
2008
15 years 3 months ago
2008
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem. Fashion is based on two efficient yet effective techniques: 1) dynam...
139
click to vote
CONNECTION
2007
15 years 3 months ago
2007
In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory...
142
Voted
NJC
2002
15 years 3 months ago
2002
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
153
Voted
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
A multiobjective genetic algorithm for detecting communities in dynamic networks, i.e., networks that evolve over time, is proposed. The approach leverages on the concept of evolu...
112
click to vote
WIOPT
2010
IEEE
15 years 2 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...