Sciweavers

4087 search results - page 135 / 818
» Sets in Types, Types in Sets
Sort
View
AML
2005
84views more  AML 2005»
13 years 9 months ago
Modularity of proof-nets
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
Roberto Maieli, Quintijn Puite
AIR
1999
90views more  AIR 1999»
13 years 8 months ago
A Survey of Automated Timetabling
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
Andrea Schaerf
IJMSO
2010
118views more  IJMSO 2010»
13 years 7 months ago
Dependencies between ontology design parameters
: Development and use of ontologies is increasing, but hampered by new challenges, such as determining which ontologies to reuse and which language to use. Ontology development met...
C. Maria Keet
HVC
2005
Springer
183views Hardware» more  HVC 2005»
14 years 2 months ago
Detecting Potential Deadlocks with Static Analysis and Run-Time Monitoring
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of concurrency error is deadlock, which occurs when a set of thr...
Rahul Agarwal, Liqiang Wang, Scott D. Stoller
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
14 years 9 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin