Sciweavers

299 search results - page 60 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
101
Voted
PVLDB
2008
81views more  PVLDB 2008»
15 years 17 days ago
Optimization of multi-domain queries on the web
Where can I attend an interesting database workshop close to a sunny beach? Who are the strongest experts on service computing based upon their recent publication record and accep...
Daniele Braga, Stefano Ceri, Florian Daniel, David...
136
Voted
DAC
2005
ACM
16 years 2 months ago
StressTest: an automatic approach to test generation via activity monitors
The challenge of verifying a modern microprocessor design is an overwhelming one: Increasingly complex micro-architectures combined with heavy time-to-market pressure have forced ...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
119
Voted
COMSWARE
2007
IEEE
15 years 7 months ago
On Optimal Performance in Mobile Ad hoc Networks
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
Tapas K. Patra, Joy Kuri, Pavan Nuggehalli
133
Voted
CSCLP
2008
Springer
15 years 2 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul