Sciweavers

721 search results - page 28 / 145
» On Generators of Random Quasigroup Problems
Sort
View
JAIR
2010
99views more  JAIR 2010»
13 years 6 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
COR
2008
175views more  COR 2008»
13 years 8 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...
SIAMJO
2008
76views more  SIAMJO 2008»
13 years 7 months ago
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
S. Damla Ahipasaoglu, E. Alper Yildirim
CEC
2005
IEEE
14 years 1 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
JGAA
2007
142views more  JGAA 2007»
13 years 7 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr