Sciweavers

4117 search results - page 327 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ISQED
2003
IEEE
85views Hardware» more  ISQED 2003»
16 years 3 days ago
Static Pin Mapping and SOC Test Scheduling for Cores with Multiple Test Sets
An algorithm for mapping core terminals to System-On-a-Chip (SOC) I/O pins and scheduling tests in order to achieve costefficient concurrent test for core-based designs is present...
Yu Huang, Wu-Tung Cheng, Chien-Chung Tsai, Nilanja...
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
15 years 11 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
15 years 11 months ago
A bio-plausible design for visual attitude stabilization
— We consider the problem of attitude stabilization using exclusively visual sensory input, and we look for a solution which can satisfy the constraints of a “bio-plausible” ...
Andrea Censi, Shuo Han, Sawyer B. Fuller, Richard ...
EVOW
2001
Springer
15 years 11 months ago
A Constructive Evolutionary Approach to School Timetabling
This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constrain...
Geraldo Ribeiro Filho, Luiz Antonio Nogueira Loren...
IJCNN
2000
IEEE
15 years 11 months ago
Using Hopfield Networks to Solve Traveling Salesman Problems Based on Stable State Analysis Technique
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
Gang Feng, Christos Douligeris