Sciweavers

4131 search results - page 48 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
IJLIT
2010
67views more  IJLIT 2010»
15 years 13 days ago
Interoperability-Centric Problems: New Challenges and Legal Solutions
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
Turgut Ayhan Beydogan
COR
2008
142views more  COR 2008»
15 years 1 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
NIPS
2004
15 years 3 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo
ICCNMC
2005
Springer
15 years 7 months ago
Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
Min-Te Sun, Xiaoli Ma, Chih-Wei Yi, Chuan-Kai Yang...
ECAI
2010
Springer
15 years 16 days ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...