Sciweavers

19320 search results - page 3508 / 3864
» On the complexity of computing determinants
Sort
View
TCOM
2008
74views more  TCOM 2008»
15 years 6 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
TCS
2008
15 years 6 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
TCS
2008
15 years 6 months ago
On temporal logic constraint solving for analyzing numerical data time series
Temporal logics and model-checking have proved successful to respectively express biological properties of complex biochemical systems, and automatically verify their satisfaction...
François Fages, Aurélien Rizk
TCSB
2008
15 years 6 months ago
Robustness to Code and Data Deletion in Autocatalytic Quines
Abstract. Software systems nowadays are becoming increasingly complex and vulnerable to all sorts of failures and attacks. There is a rising need for robust self-repairing systems ...
Thomas Meyer, Daniel Schreckling, Christian F. Tsc...
IS
2007
15 years 6 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki
« Prev « First page 3508 / 3864 Last » Next »