10493 search results - page 257 / 2099 » Dynamic Word Problems |
170
click to vote
STOC
2000
ACM
15 years 6 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
235
click to vote
NLP
2000
15 years 5 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
142
click to vote
WALCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
120
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
146
click to vote
SIAMJO
2002
15 years 1 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...