Sciweavers

4714 search results - page 321 / 943
» The Complexity of Iterated Multiplication
Sort
View
CP
2009
Springer
16 years 7 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
GLOBECOM
2007
IEEE
16 years 1 months ago
Recursive Sliding-Window LMMSE-Based Equalization in Wireless Mobile Coded OFDM
— Orthogonal frequency division multiplexing (OFDM) system suffers extra performance degradation in fast fading channels due to intercarrier interference (ICI). Combining frequen...
Daniel N. Liu, Michael P. Fitz
ICC
2007
IEEE
124views Communications» more  ICC 2007»
16 years 1 months ago
Optimal Scheduling Policy Determination for High Speed Downlink Packet Access
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
COMPSAC
2002
IEEE
15 years 11 months ago
Formalizing Incremental Design in Real-time Area: SCTL/MUS-T
Achievement of quality in software design, while never easy, is made more difficult by the inherent complexity of hard real-time (HRT) design. Furthermore, timing requirements in...
Ana Fernández Vilas, José J. Pazos A...
IS
2008
15 years 6 months ago
DFL: A dataflow language based on Petri nets and nested relational calculus
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...
Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Je...