Sciweavers

695 search results - page 52 / 139
» Efficient Algorithms for General Active Learning
Sort
View
CONCUR
2006
Springer
14 years 19 days ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
HUC
2010
Springer
13 years 7 months ago
Routine as resource for the design of learning systems
Even though the coordination of kids’ activities is largely successful, the modern dual income family still regularly experiences breakdowns in their practices. Families often r...
Scott Davidoff
DAC
2005
ACM
14 years 10 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
14 years 19 days ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
ITICSE
2005
ACM
14 years 2 months ago
A research-led curriculum in multimedia: learning about convergence
Traditional teaching methods have acknowledged limitations. Lectures may be used to transmit information efficiently, but often fail to motivate students to engage with the subjec...
Hugh C. Davis, Su White