Sciweavers

373 search results - page 57 / 75
» Automatic Generation of Symmetry-Breaking Constraints
Sort
View
AAAI
1992
13 years 11 months ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak
AIR
2006
107views more  AIR 2006»
13 years 10 months ago
Just enough learning (of association rules): the TAR2 "Treatment" learner
Abstract. An over-zealous machine learner can automatically generate large, intricate, theories which can be hard to understand. However, such intricate learning is not necessary i...
Tim Menzies, Ying Hu
ENGL
2008
100views more  ENGL 2008»
13 years 10 months ago
HIDE+: A Logic Based Hardware Development Environment
With the advent of System-On-Chip (SOC) technology, there is a pressing need to enhance the quality of ools available and increase the level of abstraction at which hardware is des...
Abdsamad Benkrid, Khaled Benkrid
VLSISP
2008
140views more  VLSISP 2008»
13 years 9 months ago
Regular Expression Matching in Reconfigurable Hardware
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
Ioannis Sourdis, João Bispo, João M....
GRAPHICSINTERFACE
2011
13 years 1 months ago
Formation sketching: an approach to stylize groups in crowd simulation
Most of existing crowd simulation algorithms focus on the moving trajectories of individual agents, while collective group formations are often roughly learned from video examples...
Qin Gu, Zhigang Deng