作者: Credence 時間: 2025-3-21 22:38
https://doi.org/10.1007/3-540-46541-3Automat; algorithms; automata; complexity; computer; computer science; data structures; formal language; for作者: 繁忙 時間: 2025-3-22 01:32 作者: Ambiguous 時間: 2025-3-22 05:01
STACS 2000978-3-540-46541-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 佛刊 時間: 2025-3-22 11:45
0302-9743 Overview: Includes supplementary material: 978-3-540-67141-1978-3-540-46541-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 不如屎殼郎 時間: 2025-3-22 16:34 作者: 眼界 時間: 2025-3-22 19:34 作者: 編輯才信任 時間: 2025-3-23 01:03
Binary Exponential Backoff Is Stable for High Arrival Rates,Goodman, Greenberg, Madras and March gave a lower bound of . . for the maximum arrival rate for which the .-user binary exponential backoff protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most . .. We improve the lower bound, showing that the protocol is stable for arrival rates up to .(. .).作者: 縫紉 時間: 2025-3-23 01:53
Horst Reichel,Sophie TisonIncludes supplementary material: 作者: 祖?zhèn)?nbsp; 時間: 2025-3-23 06:37 作者: obstinate 時間: 2025-3-23 11:45
The Boolean Hierarchy of NP-Partitions,. Whereas the structure of the latter hierarchy is rather simple the structure of the boolean hierarchy of .-partitions over NP for . ≥ 3 turns out to be much more complicated. We establish the Embedding Conjecture which enables us to get a complete idea of this structure. This conjecture is supported by several partial results.作者: 組成 時間: 2025-3-23 14:11 作者: 起波瀾 時間: 2025-3-23 20:05 作者: licence 時間: 2025-3-24 01:29 作者: 使熄滅 時間: 2025-3-24 03:23
Average-Case Quantum Query Complexity,assical algorithms. Under non-uniform distributions the gap can even be super-exponential. We also prove some general bounds for average-case complexity and show that the average-case quantum complexity of MAJORITY under the uniform distribution is nearly quadratically better than the classical complexity.作者: Ebct207 時間: 2025-3-24 07:40
Bias Invariance of Small Upper Spans,ed upwards.) The proof introduces two new techniques, namely, the . of a martingale for one probability measure to a martingale for an induced probability measure, and a new, improved . of one bias sequence to another. Consequences for the BPP versus E problem and small span theorems are derived.作者: HERTZ 時間: 2025-3-24 12:35
Succinct Representations of Model Based Belief Revision,ly, we show that Dalal’s and Weber’s operators can be compiled one into the other via a formalism whose model checking is in NP. All of our results also hold when iterated revision, for one or more of the operators, is considered.作者: 天真 時間: 2025-3-24 17:33 作者: congenial 時間: 2025-3-24 20:25
About Cube-Free Morphisms,unpublished result of Leconte: A binary morphism is cube-free if and only if the images of all cube-free words of length 7 are cube-free..We also prove that, given an alphabet . containing at least two letters, the monoid of cube-free endomorphisms on . is not finitely generated.作者: occurrence 時間: 2025-3-25 03:02
The Data Broadcast Problem with Preemption,ed. We show that this problem is .-hard, even in the simple setting where the broadcast costs are zero, and give some practical 2-approximation algorithms for broadcasting messages. We also show that preemption can improve the quality of the broadcast by an arbitrary factor.作者: faction 時間: 2025-3-25 06:24 作者: Vaginismus 時間: 2025-3-25 08:22
A New Algorithm for MAX-2-SAT, . . is the number of 2-clauses, and . is a polynomial. In addition, our algorithm and the proof are much simpler than the previous ones. The key ideas are to use the symmetric flow algorithm of Yannakakis and to count only 2-clauses (and not 1-clauses).作者: Melanocytes 時間: 2025-3-25 15:10 作者: Coordinate 時間: 2025-3-25 16:58
Circuits versus Trees in Algebraic Complexity,ructure ., it is important to find out whether NP. problems can be solved by polynomial depth computation trees, and if so whether these trees can be efficiently simulated by circuits. Point location, a problem of computational geometry, comes into play in the study of these questions for several st作者: Graphite 時間: 2025-3-25 23:35
On the Many Faces of Block Codes, of reducing decoder complexity. Necessary and sufficient conditions for subtrellis overlaying are next derived from the representation of the block code as a group, partitioned into a subgroup and its cosets. Finally a view of the code as a graph permits a combination of two shortest path algorithm作者: 是突襲 時間: 2025-3-26 01:04
A New Algorithm for MAX-2-SAT, related problems. In particular, for MAX-2-SAT Niedermeier and Rossmanith recently presented an algorithm with worstcase upper bound .(. ·2.), and the bound .(. ·2.) is implicit from the paper by Bansal and Raman (. is the number of clauses). In this paper we improve this bound to .(.)2. ./4, where作者: magenta 時間: 2025-3-26 05:38 作者: construct 時間: 2025-3-26 09:13 作者: 被詛咒的人 時間: 2025-3-26 15:16 作者: ALOFT 時間: 2025-3-26 17:38
Linear Cellular Automata with Multiple State Variables,ective (surjective) if and only if the determinant of its transition matrix is an injective (surjective, respectively) single variable automaton. We prove that in the one-dimensional case every injective automaton can be factored into a sequence of elementary automata, defined by elementary transiti作者: Hallowed 時間: 2025-3-26 20:57
Two-Variable Word Equations,unctions that give the number of words of a given length. Specifically, we prove that there are only five types of complexities: constant, linear, exponential, and two in between constant and linear. For the latter two, we give precise characterizations in terms of the number of solutions of Diophan作者: 他很靈活 時間: 2025-3-27 02:50
Average-Case Quantum Query Complexity,al can be at most polynomial [.]. We show that for . complexity under the uniform distribution, quantum algorithms can be exponentially faster than classical algorithms. Under non-uniform distributions the gap can even be super-exponential. We also prove some general bounds for average-case complexi作者: PANEL 時間: 2025-3-27 07:24 作者: 希望 時間: 2025-3-27 13:03
The Data Broadcast Problem with Preemption,o clients requesting messages, and the cost of the broadcast. This is an efficient means of disseminating data to clients, designed for environments, such as satellites, cable TV, mobile phones, where there is a much larger capacity from the information source to the clients than in the reverse dire作者: 無能力 時間: 2025-3-27 15:44
An Approximate ,,-Difference Algorithm for Massive Data Streams,. and . . are given in a data stream, and their order is chosen by an adversary. These algorithms use little space (much less than would be needed to store the entire stream) and little time to process each item in the stream and give approximations with small relative error. Using different techniq作者: 血友病 時間: 2025-3-27 17:45
Succinct Representations of Model Based Belief Revision,ctly represent a certain set of models. In particular, we show that some of these operators are more efficient than others, even though they have the sane model checking complexity. We show that these operators are partially ordered, i.e. some of them are not comparable. We also strengthen some of t作者: formula 時間: 2025-3-27 23:51 作者: Oratory 時間: 2025-3-28 03:11 作者: 截斷 時間: 2025-3-28 09:43 作者: asthma 時間: 2025-3-28 12:07 作者: vascular 時間: 2025-3-28 18:18 作者: Transfusion 時間: 2025-3-28 18:56 作者: Mitigate 時間: 2025-3-29 02:13
Kaustubh Deshmukh,Priti Shankar,Amitava Dasgupta,B. Sundar Rajanavior. The three related questions are: 1) Given a car crash, how does the likelihood that the driver is killed depend on the size of the car? 2) How does the probability of a car being involved in a crash depend on its size? 3) How does the number of driver fatalities per car per year depend on car作者: antiquated 時間: 2025-3-29 03:57
Edward A. Hirschinteraction (HCI) is a non-trivial task. Classification of human emotion involving artificial intelligence is an emerging field. HCI finds applications in smart home, industry, personal health and for different purposes. One such HCI task is an automated human emotion recognition system. In this pap作者: abject 時間: 2025-3-29 10:44 作者: evanescent 時間: 2025-3-29 13:25 作者: POWER 時間: 2025-3-29 16:58 作者: 擔(dān)心 時間: 2025-3-29 22:30 作者: 丑惡 時間: 2025-3-30 02:11
Lucian Ilie,Wojciech Plandowskiimagine myself being hurt by this or that particular object’, or ‘how do I imagine the possibility of that particular event’, which is the imaginative dimension of being vulnerable which I explained in the previous chapter, but also what kind of attitude we take towards existential vulnerability in 作者: 馬賽克 時間: 2025-3-30 04:18 作者: nitroglycerin 時間: 2025-3-30 08:46
Juraj Hromkovi?,Martin Sauerhoffan original ethical and political analysis of vulnerability .Whereas standard approaches to risk and vulnerability presuppose a strict separation between humans and their world, this book develops an existential-phenomenological approach according to which we are always already beings-at-risk. Moreo作者: Jargon 時間: 2025-3-30 12:49 作者: modest 時間: 2025-3-30 19:55
Hesham Al-Ammal,Leslie Ann Goldberg,Phil MacKenziean original ethical and political analysis of vulnerability .Whereas standard approaches to risk and vulnerability presuppose a strict separation between humans and their world, this book develops an existential-phenomenological approach according to which we are always already beings-at-risk. Moreo作者: Accessible 時間: 2025-3-30 20:44 作者: 浮夸 時間: 2025-3-31 02:37
Jessica H. Fong,Martin J. Straussn be used for condition monitoring and fault prognosis during an outbreak situation. This paper examines the adoption process and its subsequent diffusion and extended usage of RFID in Australian livestock management practices, and proposes a research model. The model is primarily built on Rogers’ i作者: ethnology 時間: 2025-3-31 06:53
Paolo Pennan be used for condition monitoring and fault prognosis during an outbreak situation. This paper examines the adoption process and its subsequent diffusion and extended usage of RFID in Australian livestock management practices, and proposes a research model. The model is primarily built on Rogers’ i作者: BILL 時間: 2025-3-31 11:47 作者: 斜坡 時間: 2025-3-31 16:35 作者: Promotion 時間: 2025-3-31 17:39 作者: barium-study 時間: 2025-4-1 00:40 作者: 發(fā)炎 時間: 2025-4-1 03:40 作者: ULCER 時間: 2025-4-1 09:19 作者: Conserve 時間: 2025-4-1 12:06 作者: Credence 時間: 2025-4-1 15:29 作者: patriot 時間: 2025-4-1 21:50
e first plotted to identify, by visual inspection, those crash-involved vehicle types that were at comparatively high and low risk of being driven by individuals who had consumed alcohol. In addition, the data were submitted to a cluster analysis program which grouped various vehicles together in th
