Sciweavers

210 search results - page 31 / 42
» Universal Booleanization of Constraint Models
Sort
View
LATA
2009
Springer
14 years 4 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
VTC
2007
IEEE
14 years 3 months ago
Q-Learning-based Hybrid ARQ for High Speed Downlink Packet Access in UMTS
Abstract-In this paper, a Q-learning-based hybrid automatic repeat request (Q-HARQ) scheme is proposed to achieve efficient resource utilization for high speed downlink packet acc...
Chung-Ju Chang, Chia-Yuan Chang, Fang-Ching Ren
JNSM
2008
130views more  JNSM 2008»
13 years 9 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
CVPR
2009
IEEE
15 years 4 months ago
Contextual Flow
Matching based on local brightness is quite limited, because small changes on local appearance invalidate the constancy in brightness. The root of this limitation is its treatme...
Ying Wu (Northwestern University), Jialue Fan (Nor...
TPHOL
2007
IEEE
14 years 3 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker