4377 search results - page 259 / 876 » Mass problems and randomness |
239
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
302
click to vote
NLP
2000
15 years 10 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...
197
click to vote
SIAMJO
2002
15 years 6 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 ...
191
click to vote
ANTS
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
198
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...