Sciweavers

1960 search results - page 299 / 392
» The Logic of Large Enough
Sort
View
AIEDAM
2011
13 years 5 months ago
Discovering implicit constraints in design
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
Madan Mohan Dabbeeru, Amitabha Mukerjee
BMCBI
2011
13 years 5 months ago
AnyExpress: Integrated toolkit for analysis of cross-platform gene expression data using a fast interval matching algorithm
Background: Cross-platform analysis of gene express data requires multiple, intricate processes at different layers with various platforms. However, existing tools handle only a s...
Jihoon Kim, Kiltesh Patel, Hyunchul Jung, Winston ...
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 5 months ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...
JAIR
2011
134views more  JAIR 2011»
13 years 5 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
LOGCOM
2010
154views more  LOGCOM 2010»
13 years 4 months ago
Collaborative Runtime Verification with Tracematches
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
Eric Bodden, Laurie J. Hendren, Patrick Lam, Ondre...