Search Results - "Viglas, A."
-
1
Fault diagnosis and logic debugging using Boolean satisfiability
Published in IEEE transactions on computer-aided design of integrated circuits and systems (01-10-2005)“…Recent advances in Boolean satisfiability have made it an attractive engine for solving many digital very-large-scale-integration design problems. Although…”
Get full text
Journal Article -
2
Design diagnosis using Boolean satisfiability
Published in ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753) (2004)“…Recent advances in Boolean satisfiability have made it an attractive engine for solving many digital VLSI design problems such as verification, model checking,…”
Get full text
Conference Proceeding
-
3
Transit Route Design Solved with Wireless Data Collection Algorithms
Published in Transportation research record (01-01-2014)“…The transit route network design problem and its variants, aiming for economically viable and efficient transit routes in urban areas, has been attracting many…”
Get full text
Journal Article -
4
RMC: An Energy-Aware Cross-Layer Data-Gathering Protocol for Wireless Sensor Networks
Published in 22nd International Conference on Advanced Information Networking and Applications (aina 2008) (01-03-2008)“…Wireless sensor networks (WSNs) consist of miniature devices with sensing, computation and wireless communication capabilities. They are typically designed for…”
Get full text
Conference Proceeding -
5
On the complexity of intersecting finite state automata and NL versus NP
Published in Theoretical computer science (13-06-2003)Get full text
Journal Article -
6
Energy-efficient data gathering with tour length-constrained mobile elements in wireless sensor networks
Published in IEEE Local Computer Network Conference (01-10-2010)“…Several studies in recent years have considered the use of mobile elements for data gathering in wireless sensor networks, so as to reduce the need for…”
Get full text
Conference Proceeding -
7
On the complexity of intersecting finite state automata
Published in Proceedings / IEEE Conference on Computational Complexity (2000)“…We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs…”
Get full text
Conference Proceeding Journal Article -
8
Mobile Element Path Planning for Gathering Transit-Time Constrained Data
Published in 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies (01-10-2011)“…In this paper we investigate the problem of gathering the data in wireless sensor network using a single Mobile Element. In particular we consider the case…”
Get full text
Conference Proceeding -
9
A Data Caching Approach for Sensor Applications
Published in 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies (01-12-2009)“…In sensor network applications, data gathering mechanisms, which are based on multi-hop forwarding, can be expensive in terms of energy. This limitation…”
Get full text
Conference Proceeding -
10
ECTC: Energy effiCient topology control algorithm for wireless sensor networks
Published in 2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops (01-06-2009)“…Sensor network which operates on battery are used to gather data in a variety of environments. The data collected by each node is communicated through the…”
Get full text
Conference Proceeding -
11
Periodic Mobile Multi-Gateway Scheduling
Published in 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies (01-12-2008)“…Recently, using mobile gateway(s) as a mechanical data carries emerges as a promising approach to prolong sensor network lifetime and relaying information in…”
Get full text
Conference Proceeding -
12
On the complexity of SAT
Published in 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) (1999)“…We show that non-deterministic time NTIME(n) is not contained in deterministic time n/sup 2-/spl epsiv// and polylogarithmic space, for any /spl epsiv/>0. This…”
Get full text
Conference Proceeding