Sciweavers

828 search results - page 94 / 166
» Simplicial Powers of Graphs
Sort
View
ICECCS
2007
IEEE
115views Hardware» more  ICECCS 2007»
15 years 8 months ago
On-the-fly model checking for C programs with extended CADP in FMICS-jETI
A current trend in the software engineering community is to integrate different tools in a friendly and powerful development environment for use by final users. This is also the c...
María-del-Mar Gallardo, Pedro Merino, Chris...
CAV
2004
Springer
121views Hardware» more  CAV 2004»
15 years 8 months ago
CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
HoonSang Jin, Mohammad Awedh, Fabio Somenzi
CASES
2001
ACM
15 years 8 months ago
Computation offloading to save energy on handheld devices: a partition scheme
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
Zhiyuan Li, Cheng Wang, Rong Xu
ICANN
2010
Springer
15 years 5 months ago
Visualising Clusters in Self-Organising Maps with Minimum Spanning Trees
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
Rudolf Mayer, Andreas Rauber
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 1 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...