Sciweavers

17298 search results - page 3150 / 3460
» Abstract computing machines
Sort
View
JANCL
2008
170views more  JANCL 2008»
15 years 4 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
CORR
2007
Springer
127views Education» more  CORR 2007»
15 years 4 months ago
Attribute Exploration of Discrete Temporal Transitions
Discrete temporal transitions occur in a variety of domains, but this work is mainly motivated by applications in molecular biology: explaining and analyzing observed transcriptome...
Johannes Wollbold
IJSNET
2006
110views more  IJSNET 2006»
15 years 4 months ago
Improving network lifetime using sensors with adjustable sensing ranges
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
Mihaela Cardei, Jie Wu, Mingming Lu
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 4 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
CORR
2007
Springer
91views Education» more  CORR 2007»
15 years 4 months ago
BrlAPI: Simple, Portable, Concurrent, Application-level Control of Braille Terminals
Screen readers can drive braille devices for allowing visually impaired users to access computer environments, by providing them the same information as sighted users. But in some...
Samuel Thibault, Sébastien Hinderer
« Prev « First page 3150 / 3460 Last » Next »