Sciweavers

2767 search results - page 312 / 554
» Universal Exponentiation Algorithm
Sort
View
140
Voted
SIGCOMM
2006
ACM
15 years 8 months ago
Jigsaw: solving the puzzle of enterprise 802.11 analysis
The combination of unlicensed spectrum, cheap wireless interfaces and the inherent convenience of untethered computing have made 802.11-based networks ubiquitous in the enterprise...
Yu-Chung Cheng, John Bellardo, Péter Benk&o...
164
Voted
HT
2005
ACM
15 years 8 months ago
A tactile web browser for the visually disabled
The dissemination of information available through the World Wide Web makes universal access more and more important and supports visually disabled people in their everyday life. ...
Martin Rotard, Sven Knödler, Thomas Ertl
106
Voted
CPAIOR
2004
Springer
15 years 8 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel
116
Voted
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
15 years 8 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
SEMWEB
2004
Springer
15 years 8 months ago
Query Answering for OWL-DL with Rules
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...
Boris Motik, Ulrike Sattler, Rudi Studer