Sciweavers

1920 search results - page 171 / 384
» The Complexity of the A B C Problem
Sort
View
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...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 6 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
EMSOFT
2009
Springer
15 years 10 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ICSE
2007
IEEE-ACM
16 years 20 days ago
Workshop on Software Technologies for Ultra-Large Scale Systems
Given the inevitable trends towards increasing complexity of software-intensive systems, many future software-intensive systems will be ultra-large scale (ULS). Radical scale-up o...
Richard P. Gabriel, Rick Kazman, Linda M. Northrop...
ARTS
1997
Springer
15 years 10 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke