15033 search results - page 211 / 3007 » Complexity Theory and Algorithms |
101
click to vote
MLQ
2008
15 years 4 months ago
2008
Abstract. We give an elementary theory of Henselian local rings and construct the Henselization of a local ring. All our theorems have an algorithmic content.
138
click to vote
JACM
1998
15 years 4 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
117
click to vote
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
134
click to vote
IM
2007
15 years 4 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
180
click to vote
CODES
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling in behavioral synthesis. The problem of schedulin...