Sciweavers

669 search results - page 80 / 134
» New Constraint Programming Approaches for the Computation of...
Sort
View
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
14 years 3 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
CONEXT
2010
ACM
13 years 6 months ago
Auto-configuration of 802.11n WLANs
Channel Bonding (CB) combines two adjacent frequency bands to form a new, wider band to facilitate high data rate transmissions in MIMO-based 802.11n networks. However, the use of...
Mustafa Y. Arslan, Konstantinos Pelechrinis, Ioann...
LCTRTS
2001
Springer
14 years 28 days ago
ILP-based Instruction Scheduling for IA-64
The IA-64 architecture has been designed as a synthesis of VLIW and superscalar design principles. It incorporates typical functionality known from embedded processors as multiply...
Daniel Kästner, Sebastian Winkel
AISC
2008
Springer
13 years 10 months ago
The Monoids of Order Eight and Nine
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
Andreas Distler, Tom Kelsey
ICPR
2002
IEEE
14 years 9 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...