2168 search results - page 144 / 434 » Randomized Algorithms and Complexity Theory |
127
click to vote
CSC
2008
15 years 4 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
131
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
123
click to vote
AAAI
1990
15 years 4 months ago
1990
This paper studies sorted generalization-the generalization, with respect to an arbitrary taxonomic theory, of atomic formulas containing sorted variables. It develops an algorith...
125
Voted
ECAL
2005
Springer
15 years 9 months ago
2005
Springer
An evolutionary reinforcement-learning algorithm, the operation of which was not associated with an optimality condition, was instantiated in an artificial organism. The algorithm ...
108
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper we consider the problem of semiblind carrier frequency offset (CFO) estimation for OFDM systems. Specifically, we consider a synchronization scheme based on the ...