Sciweavers

1998 search results - page 284 / 400
» Complexity of the Cover Polynomial
Sort
View
ISVLSI
2007
IEEE
181views VLSI» more  ISVLSI 2007»
16 years 24 days ago
Code-coverage Based Test Vector Generation for SystemC Designs
Abstract— Time-to-Market plays a central role on System-ona-Chip (SoC) competitiveness and the quality of the final product is a matter of concern as well. As SoCs complexity in...
Alair Dias Jr., Diógenes Cecilio da Silva J...
CP
2007
Springer
16 years 20 days ago
Dynamic Management of Heuristics for Solving Structured CSPs
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
ESAW
2007
Springer
16 years 20 days ago
Arguing about Reputation: The LRep Language
In the field of multiagent systems (MAS), the computational models of trust and reputation have attracted increasing interest since electronic and open environments became a reali...
Isaac Pinyol, Jordi Sabater-Mir
ESWS
2007
Springer
16 years 20 days ago
Developing Ontologies for Collaborative Engineering in Mechatronics
Abstract. Creating a coherent set of ontologies to support a collaborative design process amongst different firms which develop mechatronic products is a challenge due to the seman...
Violeta Damjanovic, Wernher Behrendt, Manuela Pl&o...
GECCO
2007
Springer
234views Optimization» more  GECCO 2007»
16 years 20 days ago
Applying particle swarm optimization to software testing
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
Andreas Windisch, Stefan Wappler, Joachim Wegener