CEC
2010
IEEE
13 years 10 months ago
2010
IEEE
This paper describes and experimentally evaluates the viability of the (
IJCGA
2010
13 years 11 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
ORDER
2007
13 years 12 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
ORL
2002
14 years 2 days ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
ETS
2000
IEEE
14 years 7 days ago
2000
IEEE
This paper describes experiences with on-line and in-class sections of a writing-intensive course, including a collaborative library literacy unit. It reports on a mid-semester so...
SIAMDM
2008
14 years 10 days ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
ISAAC
2001
Springer
14 years 4 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
ERCIMDL
2001
Springer
14 years 5 months ago
2001
Springer
Abstract. With the rapid development of on-line information services, information technologies for on-line information processing have been receiving much attention recently. Clust...
WMCSA
2003
IEEE
14 years 5 months ago
2003
IEEE
1 In this work we consider the mobility of personal online identifiers. People change the identifiers through which they are reachable on-line as they change jobs or residences ...
ISAAC
2004
Springer
14 years 5 months ago
2004
Springer
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...