11565 search results - page 1949 / 2313 » Computing Minimal Mappings |
155
click to vote
ATAL
2003
Springer
16 years 2 days ago
2003
Springer
This paper describes how multiagent systems can be used to achieve robust software, one of the major goals of software engineering. The paper first positions itself within the sof...
207
click to vote
AUSAI
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
141
click to vote
COCOON
2003
Springer
16 years 2 days ago
2003
Springer
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
192
click to vote
COLT
2003
Springer
16 years 2 days ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
211
click to vote
DBISP2P
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. We are witnessing a dramatic increase in the use of datacentric distributed systems such as global grid infrastructures, sensor networks, network monitoring, and various ...