Sciweavers

7820 search results - page 232 / 1564
» Formalization of Time and Space
Sort
View
C3S2E
2010
ACM
15 years 8 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
ISLPED
2010
ACM
158views Hardware» more  ISLPED 2010»
15 years 7 months ago
Temperature- and energy-constrained scheduling in multitasking systems: a model checking approach
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
Weixun Wang, Xiaoke Qin, Prabhat Mishra
IJAHUC
2006
128views more  IJAHUC 2006»
15 years 7 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui
IS
2008
15 years 7 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
JAPLL
2008
121views more  JAPLL 2008»
15 years 7 months ago
Reasoning with prioritized information by iterative aggregation of distance functions
We introduce a general framework for reasoning with prioritized propositional data by aggregation of distance functions. Our formalism is based on a possible world semantics, wher...
Ofer Arieli