Sciweavers

CEC
2010
IEEE
13 years 1 months ago
On-line evolution of robot controllers by an encapsulated evolution strategy
This paper describes and experimentally evaluates the viability of the (
Evert Haasdijk, A. E. Eiben, Giorgos Karafotias
IJCGA
2010
155views more  IJCGA 2010»
13 years 2 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
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 ...
Yoav Gabriely, Elon Rimon
ORDER
2007
89views more  ORDER 2007»
13 years 3 months ago
On-line Chain Partitioning of Up-growing Interval Orders
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 ...
Patrick Baier, Bartlomiej Bosek, Piotr Micek
ORL
2002
81views more  ORL 2002»
13 years 3 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
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...
Leah Epstein, John Noga, Gerhard J. Woeginger
ETS
2000
IEEE
156views Hardware» more  ETS 2000»
13 years 3 months ago
Parallel On-Line and In-Class Sections of "Writing for the Professions": A Practical Experiment
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...
Victoria Hay, Dennis Isbell
SIAMDM
2008
148views more  SIAMDM 2008»
13 years 3 months ago
A New Algorithm for On-line Coloring Bipartite Graphs
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...
Hajo Broersma, Agostino Capponi, Daniël Paulu...
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
13 years 8 months ago
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
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...
Hisashi Koga
ERCIMDL
2001
Springer
131views Education» more  ERCIMDL 2001»
13 years 8 months ago
An On-Line Document Clustering Method Based on Forgetting Factors
Abstract. With the rapid development of on-line information services, information technologies for on-line information processing have been receiving much attention recently. Clust...
Yoshiharu Ishikawa, Yibing Chen, Hiroyuki Kitagawa
WMCSA
2003
IEEE
13 years 9 months ago
A Historic Name-Trail Service
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 ...
Petros Maniatis, Mary Baker
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
13 years 9 months ago
On-Line Windows Scheduling of Temporary Items
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...
Wun-Tat Chan, Prudence W. H. Wong