16430 search results - page 2659 / 3286 » On Computable Tree Functions |
189
click to vote
ECAI
2006
Springer
15 years 9 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
205
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
306
click to vote
CIBCB
2007
IEEE
15 years 9 months ago
2007
IEEE
—In metabolic engineering it is difficult to identify which set of genetic manipulations will result in a microbial strain that achieves a desired production goal, due to the co...
199
click to vote
CONEXT
2007
ACM
15 years 9 months ago
2007
ACM
Network intrusion detection systems typically detect worms by examining packet or flow logs for known signatures. Not only does this approach mean worms cannot be detected until ...
252
click to vote
CODES
2008
IEEE
15 years 9 months ago
2008
IEEE
It is well recognized that novel computational models, devices and technologies are needed in order to sustain the remarkable advancement of CMOS-based VLSI circuits and systems. ...