Sciweavers

5378 search results - page 323 / 1076
» Base Logics in Argumentation
Sort
View
FPGA
2008
ACM
151views FPGA» more  FPGA 2008»
15 years 8 months ago
Beyond the arithmetic constraint: depth-optimal mapping of logic chains in LUT-based FPGAs
Look-up table based FPGAs have migrated from a niche technology for design prototyping to a valuable end-product component and, in some cases, a replacement for general purpose pr...
Michael T. Frederick, Arun K. Somani
189
Voted
JAR
2007
129views more  JAR 2007»
15 years 6 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
Carsten Lutz, Maja Milicic
TMM
2002
83views more  TMM 2002»
15 years 6 months ago
Systematic evaluation of logical story unit segmentation
Abstract--Although various Logical Story Unit (LSU) segmentation methods based on visual content have been presented in literature, a common ground for comparison is missing. We pr...
Jeroen Vendrig, Marcel Worring
JAPLL
2007
88views more  JAPLL 2007»
15 years 6 months ago
Some comments on history based structures
History based models, introduced by Parikh and Ramanujam, provide a natural mathematical model of social interactive situations. These models offer a ”low level” description ...
Eric Pacuit
177
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...