Sciweavers

2035 search results - page 237 / 407
» On the complexity of stratified logics
Sort
View
ECCC
2006
145views more  ECCC 2006»
15 years 6 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
SOFSEM
2007
Springer
16 years 18 days ago
Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems
Abstract. The increasing complexity of today’s embedded systems applications imposes the requirements and constraints of distributed, heterogeneous subsystem interaction to softw...
Dietmar Schreiner, Karl M. Göschka
COMSWARE
2006
IEEE
16 years 16 days ago
Separating control software from routers
Abstract— Control software in routers have gotten increasingly complex today. Further, since the control software runs in every router, managing a large network of routers is com...
Ramachandran Ramjee, Furquan Ansari, Martin Havema...
CAMP
2005
IEEE
16 years 3 days ago
Bio-Inspired Computing Architectures: The Embryonics Approach
Abstract— The promise of next-generation computer technologies, such as nano-electronics, implies a number of serious alterations to the design flow of digital circuits. One of ...
Gianluca Tempesti, Daniel Mange, André Stau...
SSDBM
2005
IEEE
131views Database» more  SSDBM 2005»
16 years 1 days ago
Searching for Related Objects in Relational Databases
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
Xiaoxin Yin, Jiawei Han, Jiong Yang