Sciweavers

5981 search results - page 287 / 1197
» time 2006
Sort
View
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 6 months ago
Learning acceptable windows of contingency
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
Kevin Gold, Brian Scassellati
NC
2006
116views Neural Networks» more  NC 2006»
15 years 6 months ago
Automated Design and Programming of a Microfluidic DNA Computer
Previously, we described ways to implement the functions AND and OR in a DNA computer consisting of microreactors with attached heating elements that control annealing of DNA. Base...
Michael S. Livstone, Ron Weiss, Laura F. Landweber
183
Voted
AAAI
2007
15 years 9 months ago
Modeling and Learning Vague Event Durations for Temporal Reasoning
This paper reports on our recent work on modeling and automatically extracting vague, implicit event durations from text (Pan et al., 2006a, 2006b). It is a kind of commonsense kn...
Feng Pan, Rutu Mulkar, Jerry R. Hobbs
ACID
2006
264views Algorithms» more  ACID 2006»
15 years 8 months ago
A Parameterized View on Matroid Optimization Problems
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
Dániel Marx
EUROPLOP
2006
15 years 8 months ago
Business Logic in the Presentation Layer - Design Patterns on the Implementation of Business Logic on the Client-Side
Abstract: As a general rule of thumb, business logic in a multi-layered information system should be implemented in a dedicated domain layer and be separated from the presentation ...
Tim Wellhausen