Sciweavers

429 search results - page 59 / 86
» Solving the Maximum Clique Problem Using PUBB
Sort
View
ICCAD
2003
IEEE
124views Hardware» more  ICCAD 2003»
14 years 4 months ago
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
Zhiru Zhang, Yiping Fan, Miodrag Potkonjak, Jason ...
SSPR
1998
Springer
13 years 12 months ago
A Statistical Clustering Model and Algorithm
In this paper, a statistical clustering model and algorithm have been discussed. Finding the optimal solution to clustering problem is transformed into simulating the equilibrium ...
Guangwen Yang, Weimin Zheng, Dingxing Wang
SIROCCO
2004
13 years 9 months ago
Two-Hop Virtual Path Layout in Tori
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
Sébastien Choplin, Lata Narayanan, Jaroslav...
JSAC
2006
100views more  JSAC 2006»
13 years 7 months ago
An improved algorithm for optimal lightpath establishment on a tree topology
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
GRAMMARS
2002
119views more  GRAMMARS 2002»
13 years 7 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an