14165 search results - page 666 / 2833 » The generalized two-server problem |
230
click to vote
AGP
2003
IEEE
16 years 16 days ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
207
click to vote
FSTTCS
2003
Springer
16 years 14 days ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
221
click to vote
COMPGEOM
2010
ACM
16 years 10 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
170
click to vote
GECCO
2009
Springer
15 years 12 months ago
2009
Springer
Evolution of neural networks, as implemented in NEAT, has proven itself successful on a variety of low-level control problems such as pole balancing and vehicle control. Nonethele...
181
click to vote
ISCAS
1994
IEEE
15 years 11 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...