Sciweavers

424 search results - page 75 / 85
» Realizability models and implicit complexity
Sort
View
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
14 years 8 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
SAC
2010
ACM
13 years 8 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
CORR
2007
Springer
170views Education» more  CORR 2007»
13 years 8 months ago
Animation of virtual mannequins, robot-like simulation or motion captures
— In order to optimize the costs and time of design of the new products while improving their quality, concurrent engineering is based on the digital model of these products, the...
Damien Chablat
ATAL
2009
Springer
14 years 3 months ago
Improving adjustable autonomy strategies for time-critical domains
As agents begin to perform complex tasks alongside humans as collaborative teammates, it becomes crucial that the resulting humanmultiagent teams adapt to time-critical domains. I...
Nathan Schurr, Janusz Marecki, Milind Tambe
INFOCOM
2007
IEEE
14 years 2 months ago
Cross-Layer Analysis of Rate Adaptation, DCF and TCP in Multi-Rate WLANs
—Wireless Internet access is facilitated by IEEE 802.11 WLANs that, in addition to realizing a specific form of CSMA/CA—distributed coordination function (DCF)— implement a ...
Jaehyuk Choi, Kihong Park, Chongkwon Kim