Sciweavers

8728 search results - page 1338 / 1746
» On Reduct Construction Algorithms
Sort
View
PLDI
2010
ACM
16 years 4 months ago
Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
16 years 4 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
ALT
2006
Springer
16 years 3 months ago
Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
Takeshi Shibata, Ryo Yoshinaka, Takashi Chikayama
ICCAD
2008
IEEE
141views Hardware» more  ICCAD 2008»
16 years 3 months ago
Layout decomposition for double patterning lithography
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...
WOSP
2010
ACM
16 years 1 months ago
Analytical modeling of lock-based concurrency control with arbitrary transaction data access patterns
Nowadays the 2-Phase-Locking (2PL) concurrency control algorithm still plays a core rule in the construction of transactional systems (e.g. database systems and transactional memo...
Pierangelo di Sanzo, Roberto Palmieri, Bruno Cicia...
« Prev « First page 1338 / 1746 Last » Next »