Sciweavers

10568 search results - page 1867 / 2114
» Computer Intelligence and Formalization
Sort
View
JSAC
2006
157views more  JSAC 2006»
15 years 4 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
FUIN
2007
130views more  FUIN 2007»
15 years 4 months ago
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
Thomas Eiter, Esra Erdem, Wolfgang Faber, Já...
IIE
2007
116views more  IIE 2007»
15 years 4 months ago
Turtle's Navigation and Manipulation of Geometrical Figures Constructed by Variable Processes in a 3d Simulated Space
Abstract. Issues related to 3d turtle’s navigation and geometrical figures’ manipulation in the simulated 3d space of a newly developed computational environment, MaLT, are re...
Chronis Kynigos, Maria Latsi
SIGMETRICS
2008
ACM
15 years 4 months ago
Scheduling despite inexact job-size information
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
Adam Wierman, Misja Nuyens
IJFCS
2007
111views more  IJFCS 2007»
15 years 4 months ago
Involutively Bordered Words
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over th...
Lila Kari, Kalpana Mahalingam
« Prev « First page 1867 / 2114 Last » Next »