Sciweavers

3663 search results - page 297 / 733
» Problems in the ontology of computer programs
Sort
View
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
15 years 11 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He
FOSSACS
2007
Springer
16 years 26 days ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
15 years 11 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
COLING
2010
15 years 1 months ago
A Comparative Study on Ranking and Selection Strategies for Multi-Document Summarization
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...
Feng Jin, Minlie Huang, Xiaoyan Zhu
POLICY
2007
Springer
16 years 25 days ago
Proteus: A Semantic Context-Aware Adaptive Policy Model
The growing diffusion of portable devices enables users to benefit from anytime and anywhere impromptu collaboration. Appropriate policy models that take into account the dynamici...
Alessandra Toninelli, Rebecca Montanari, Lalana Ka...