Sciweavers

212 search results - page 24 / 43
» Activating refactorings faster
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
ECRTS
2006
IEEE
14 years 1 months ago
Sensitivity Analysis for Fixed-Priority Real-Time Systems
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Lat...
Enrico Bini, Marco Di Natale, Giorgio C. Buttazzo
AAAI
2006
13 years 9 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
ECIS
2000
13 years 9 months ago
Pricing Digital Information Goods and Services on the Net
Many analysts argue that the Internet is producing a fundamental change in the way that business works. The network economy grows faster every day. Internet markets are developing ...
Laurent L. Pauwels, Paul B. McLeod
WSC
1997
13 years 9 months ago
Using Compensating Reconfiguration to Maintain Military Distributed Simulations
In Department of Defense (DoD) distributed training simulations, events occur that can cause unrealistic behavior. These events can be system events, such as the loss of a hostor ...
Donald J. Welch, James M. Purtilo