5214 search results - page 14 / 1043 » The Online Specialization Problem |
GD
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
AMAST
2008
Springer
13 years 9 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
A growing trend in commercial search engines is the display of specialized content such as news, products, etc. interleaved with web search results. Ideally, this content should b...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...