3663 search results - page 112 / 733 » Problems in the ontology of computer programs |
161
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
143
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
149
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
182
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
193
click to vote
ICNC
2009
Springer
15 years 10 months ago
2009
Springer
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...