1798 search results - page 265 / 360 » Considerations for the design of exergames |
146
click to vote
CASCON
1996
15 years 7 months ago
1996
Developing and managing applications for environments consisting of independently con gured computing systems interoperating acrossnetwork connections is of considerable interest ...
155
click to vote
ASPDAC
2008
ACM
15 years 7 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
186
click to vote
C3S2E
2010
ACM
15 years 7 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
166
click to vote
ETS
2010
IEEE
15 years 7 months ago
2010
IEEE
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
153
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...