Sciweavers

868 search results - page 34 / 174
» Finding Most Likely Solutions
Sort
View
DIGRA
2005
Springer
14 years 1 months ago
Girls Creating Games: Challenging Existing Assumptions about Game Content
In a reinforcing cycle, few females create games and fewer girls than boys play games. In this paper, we increase our understanding of what girls like about games and gaming by de...
Jill Denner, Steven Bean, Linda L. Werner
ICCBR
2001
Springer
14 years 4 days ago
Applying CBR and Object Database Techniques in Chemical Process Design
The aim of this paper is to introduce a new method for finding and reusing process equipment design and inherently safer process configurations by case-based reasoning (CBR) and ob...
Timo Seuranen, Elina Pajula, Markku Hurme
ICCAD
1999
IEEE
76views Hardware» more  ICCAD 1999»
14 years 52 min ago
Optimal allocation of carry-save-adders in arithmetic optimization
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
Junhyung Um, Taewhan Kim, C. L. Liu
ICDCS
1998
IEEE
13 years 12 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen
AAAI
2008
13 years 10 months ago
Minimizing the Spread of Contamination by Blocking Links in a Network
We address the problem of minimizing the propagation of undesirable things, such as computer viruses or malicious rumors, by blocking a limited number of links in a network, a dua...
Masahiro Kimura, Kazumi Saito, Hiroshi Motoda